S(m,n) = { k₁, k₂, k₃, ..., k_x }, Each k_i can meet n % k_i + m % k_i >= k_i. Now output the sum of phi(k_i) , (1<= i <=x) which stands for the number of k_i's relatively prime which are smaller than k_i .

Input contains multiple test cases, no more than 100. Each has a line contains two integer m , n (1<=m,n<10⁸).

For each test cases, output the sum of phi(ki) (1<=i<=x).

2 3

6

m=2, n=3. So  S{2,3} = {4,5}, phi(4)+phi(5)=6