SOLVE
LATER
Micro purchased an array $$A$$ having $$N$$ integer values. After playing it for a while, he got bored of it and decided to update value of its element. In one second he can increase value of each array element by $$1$$. He wants each array element's value to become greater than or equal to $$K$$. Please help Micro to find out the minimum amount of time it will take, for him to do so.
Input:
First line consists of a single integer, $$T$$, denoting the number of test cases.
First line of each test case consists of two space separated integers denoting $$N$$ and $$K$$.
Second line of each test case consists of $$N$$ space separated integers denoting the array $$A$$.
Output:
For each test case, print the minimum time in which all array elements will become greater than or equal to $$K$$. Print a new line after each test case.
Constraints:
$$1 \le T \le 5$$
$$1 \le N \le 10^5$$
$$1 \le A[i], K \le 10^6$$
For first test case,
After $$1$$ second, array will be $$\{ 2, 3, 6\}$$
After $$2$$ second, array will be $$\{ 3, 4, 7\}$$
After $$3$$ second, array will be $$\{ 4, 5, 8\}$$
So it will take $$3$$ second for all array elements to become greater than or equal to $$4$$.