Problem Statement:
Ahmad has bought a new farm recently. He wants to invite his relatives to a party at his new farm. He bought N trees to plant it at the farm, for each tree Ahmad knows exactly how many days after the planting day it needs to grow to full maturity. Unfortunately, he forgot to tell his wife about that. Today his wife told him that she confirmed the party at day D from now and invited all guests!
Ahmad wants your help to find out the maximum number of trees that he can plant and let them grow to full maturity before party day if he starts planting tomorrow. Keep in mind that Ahmad can choose the order of planting the trees as he likes but he can plant only one tree at a day.

Input Format:
First line contains K (1 ≤ K ≤ 100) number of test cases. Each line in the next K lines contains: party day D (1 ≤ D ≤ 100000000) followed by number of trees N (1 ≤ N ≤ 100000) followed by N numbers ti denotes the number of days that tree i needs to grow to full maturity (1 ≤ ti ≤ 1000000).

Output Format:
For each test case your program should print one line contains one integer represents the maximum number of trees that can grow to full maturity if Ahmad starts planting tomorrow.

Sample Input:
2 8 5 2 3 4 3 4 45 8 36 40 36 37 39 40 38 40

Sample Output:
5 8

Added by: samiemad
Added at: 2014-02-26 01:15:04 UTC
Time Limit: 3 seconds
Partial score: No
Source:ACM Syrian Collegiate Programming Contest 2013