## Problem Description

Given a sequence, your task is to find the number of its continual subsequence whose sum equal to a given integer m.

## Input

The first line of the input contains an integer t which is the number of test cases. The first line of each case contains
two integers n and m, (1<= n <= 1000000) The following line contains n integers.

## Output

Output one integer for each case.

## Sample Input

1
1 1
1

## Sample Output

1

## Source

FZU 2006 ICPC Qualification Round I