Counter Strike

Time Limit: 1000ms
Memory Limit: 32768KB
This problem will be judged on HDU. Original ID: 2443
64-bit integer IO format: %I64d      Java class name: Main

Description

Anti-terrorism is becoming more and more serious nowadays. The country now has n soldiers,and every solider has a score.

We want to choose some soldiers to fulfill an urgent task. The soldiers chosen must be adjacent to each other in order to make sure that they can cooperate well. And all the soldiers chosen must have an average score greater than a.

Now, please calculate how many ways can the chief of staff choose the soldiers.

Input

The first line consists of a single integer t, indicating number of test cases.

For each test case, the first line gives n, the number of soldiers, and a, the minimum possible average score(n<=100000,a<=10000). The second line gives n integers, corresponding to the soldiers' scores in order. All the scores are no greater than 10000.

Output

An integer n, number of ways to choose the soldiers.

Sample Input

2
5 3
1 3 7 2 4
1 1000
9999

Sample Output

10
1

Source

Language: 
Theme: 
Share Code? 

Powered by NB231 | Current Style: .