Water
Description
Now there are $n$ people lining up to get some water, the $i^{th}$ person wants to get $c_i$ liters of water into his or her bottle.
When the bucket of water on the water dispenser runs out (Each bucket of water provides $C$ liters of water) , the one who is using the water dispenser (includes the last one) will replace the bucket on the dispenser with a new bucket or water, even if he or she have got enough water. Then he or she leaves right away, so one may leaves with less water than one wants.
Now you want to know how many buckets of water needed (including the first bucket).
The first line contains a single integer $T\ (1\le T\le 100)$ - the number of testcases.
Each testcase contains two lines.
The first line contains two integers $n,C\ (1\le \sum n\le 10^6,1\le C\le 10^3)$.
The second line contains $n$ integers $c_i\ (1\le c_i\le10^3)$.
For each testcase, print a positive integer representing the number of buckets needed.
Input
The first line contains a single integer $T\ (1\le T\le 100)$ - the number of testcases.
Each testcase contains two lines.
The first line contains two integers $n,C\ (1\le \sum n\le 10^6,1\le C\le 10^3)$.
The second line contains $n$ integers $c_i\ (1\le c_i\le10^3)$.
Output
For each testcase, print a positive integer representing the number of buckets needed.
4
3 1
6 4 5
4 1
1 6 4 5
2 10
5 2
5 10
8 6 7 10 2
4
5
1
3