Xsquare loves to play with the coins very much. Today , he has N stacks of coins . Each stack of coins has some non zero height H_i equal to the number of coins on that stack ( considering all the coins are identical and each coin has a height of 1 unit ) .

In one move, Xsquare can select any number of consecutive stacks of coins such that the height of each selected stack of coins H_i ≤ K . Once such a sequence of stacks is chosen , Xsquare can collect any number of coins from the chosen sequence of stacks .

Xsquare wonders what is the maximum number of coins that he can collect this way ?

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 K where N being the number of stacks of coins. Second line of each test case contains N space separated integers denoting the number of coins H_i on each stack .

OUTPUT

For each test case , Print the maximum number of coins Xsquare can collect following the above gaming strategy.

CONSTRAINTS

1 ≤ T ≤ 10⁵

1 ≤ N ≤ 10⁵

1 ≤ K ≤ 10⁹

1 ≤ H_i ≤ 10⁹

Note :

sum of N over all the test case will not exceed 10⁶.