#### 1422 问题 B: m and n

S(m,n) = { k1, k2, k3, ..., kx }, Each ki can meet n % ki + m % ki >= ki. Now output the sum of phi(ki) , (1<= i <=x) which stands for the number of ki's relatively prime which are smaller than ki .

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

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

2 3

6