Problem Background

In the year XXXX, detective Xiaoming received a mysterious message from an organization, stating that there was a mysterious door somewhere in City Y. Upon arriving at the door, Xiaoming found a line of text on it: "This door requires a password to unlock." After searching left and right, Xiaoming finally found a note: "Now, given n numbers, please find out how many consecutive sequences among these n numbers have an average greater than a given number M. Note: This number might be very large, so output the result modulo 92084931. The final result is the password to this door." Xiaoming pondered for a long time but couldn't find the answer. So, he turned to you for help. Please help him solve this problem. Xiaoming is in a hurry and can wait for at most 1 second.

Problem Description

Given n numbers, help Xiaoming find out how many consecutive sequences among these numbers have an average greater than a given number M, and output this count. Note: This number might be very large, so output the result modulo 92084931.

Input Format

Two lines. The first line contains two numbers n and M. The second line contains n numbers.

Output Format

One line with one number, which is the solution modulo 92084931.

Sample Input and Output

Sample Input #1

4 3
1 5 4 2

Sample Output #1

5

Sample Input #2

4 4
5 2 7 3

Sample Output #2

6

Notes

Sample Explanation

① For these 4 numbers, the solutions are {5}, {4}, {5,4}, {1,5,4}, {5,4,2}, totaling 5 groups.

② For these 4 numbers, the solutions are {5}, {7}, {2,7}, {7,3}, {5,2,7}, {5,2,7,3}, totaling 6 groups.

Data Scale

For 10% of the data, 1 < n ≤ 10.

For 30% of the data, 1 < n ≤ 1000.

For 50% of the data, 1 < n ≤ 30000.

For 100% of the data, 1 < n ≤ 200000, 1 < M ≤ 3000, each number is a positive integer not exceeding 5000.

见题面 Input 部分

见题面 Output 部分