GCD

Time Limit: 1000 ms Memory Limit: 65536 KiB

Problem Description

The greatest common dividsor GCD(a,b) of two positive integers a and b, sometimes written(a,b), is the largest divisor common to a and b. For example, (1,2)=1,(12,18)=6. (a,b) can be easily found by the Euclidean algorithm. Now Carp is considering a little more difficult problem: Given integers N and M, how many integer X satifies 1<=X<=N and (X,N)>=M.

Input

The first line of input is an integer T(T<=3000) representing the number of test cases. The following T lines each contains two numbers N and M (1<=N<=1000000000,0<=M<=1000000000), representing a test case.

Output

For each test case, output the answer on a single line.

Sample Input

3
1 1
10 2
10000 72

Sample Output

1
6
260

Hint

Source

第9届中山大学程序设计竞赛预选赛