0
Given A,B print the number of pairs (a,b) such that GCD(a,b)=1 and 1<=a<=A and 1<=b<=B.
Input:
First line contains T, the number of testcases. Each testcase consists of two space separated integers denoting A and B.
Output:
The Number of pairs which have GCD=1
Constraints:
1 <= T <= 10
1 <...