Kids love candy

Time limit1sMemory limit128 MB

Summary

Each test case gives candy piles and K, and asks for the most children who can each receive at least K pieces of a single kind.

Level: Easy2 of 10
Topics: Math, Greedy
Solved: No attempts yet

Problem

Seungtaek's son just had his birthday, and Seungtaek wants to throw him a birthday party.

He cannot invite every one of his son's friends, because he does not have enough candy to hand out.

A child always wants to eat candy of one single kind. On top of that, a child is happy only after receiving at least $K$ pieces of that one kind.

You are given $K$ and the kinds and amounts of candy Seungtaek has right now. What is the largest number of children that can come to the birthday party?

Input

The first line contains the number of test cases $T$ . ( $1 \le T \le 100$ )

The first line of each test case contains the number of candy kinds $N$ that Seungtaek has, and $K$ . ( $1 \le N, K \le 100$ )

The second line contains $N$ integers. The $i$ -th number is how many pieces of the $i$ -th kind he has.

For every kind the amount is at least 1 and at most 100.

Output

For each test case, print the largest number of children that can attend the birthday party as a single integer on its own line.

Examples1

Example 1
Input
```
2
3 2
4 5 7
3 8
4 5 7
```
Expected output
```
7
0
```