All Tracks Basic Programming Implementation Basics of Implementation Problem

Surojit is an awesome cricketer of JGEC. His passion for the game & his talents are well known to everyone. Now he has a very weird hobby. He collects all the balls in each of the matches he has played and stores them in cylindrical containers one ball on top of other, thus forming a “stack” of balls.

So, he has many such stack of balls kept in his room. Each stack has height H_i , denoting the number of balls in that particular stack. One fine day, Surojit decides to play a small game. This game consists of many number of rounds. In each round, he can select any number of consecutive stack of balls, such that number of balls selected is maximum. But wait, there’s a catch! The height of the stacks must be at most M. Now help Surojit to select maximum number of balls. You have the liberty to play any number of rounds.

INPUT
First line of input contains a single integer T denoting the number of test cases. First line of each test case contains two space separated integers N and M where N being the number of stacks of balls. Second line of each test case contains N space separated integers denoting the number of balls H_i on each stack.

OUTPUT
For each test case , print the maximum number of balls Surojit can collect following the above gaming strategy in a new line.

CONSTRAINTS

• 1 ≤ T ≤ 10⁵
• 1 ≤ N ≤ 10⁵
• 1 ≤ M ≤ 10⁹
• 1 ≤ H_i ≤ 10⁹