Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

GCD Plus LCM

Limits 1s, 512 MB

In this problem you will be given two integers aa, bb. You have to answer if GCD(a,b)+LCM(a,b)=a+bGCD(a, b) + LCM(a, b) = a+b is true or not.

Input

Input begins with an integer TT (0<T1060 < T ≤ 10^6) for the number of cases to follow. Next T lines each contain two integers aa and bb (0<a,b10180 < a, b ≤ 10^{18}).

Output

For each case print true\texttt{true} or false\texttt{false} without quotes according to the problem statement.

Sample

InputOutput
3
2 10
2 3
4 6
true
false
false

Discussion

Toph uses cookies. By continuing you agree to our Cookie Policy.