Time Limit: 2000 MS    Memory Limit: 65536 K 


Description

Given n integers x1 x2 ... xn, you should count how many intergers from 1 to m that can be divided by at least one of them.

Input

The first line is an integer c which shows the number of cases. Each case contains 2 lines. The first line has 2 integers n and m. The second line contains n integers. (0 < n < 11, 0 < m < 2^31, 0 < xi < 100)

Output

For each case print the answer in a single line.

Sample Input

2 1 10 2 2 20 3 4

Sample Output

5 10

Source

The Star of ACMClub 2007 @ HIT