# Ghum Over Everything

Limits 2s, 128 MB

Sheldon and Leonard are roommates. Usually Leonard drives Sheldon to work everyday as Sheldon can’t drive and hates bus. For some reason, Leonard has gone to his home for indefinitely. So, Sheldon asks Penny who lives across the hall to drive him to work. As we all know Sheldon is and annoying person to be with and Penny hates to get up at 7am! So, they signed a contract which states the following-

Sheldon gives Penny two integers $P$ and $D$. Sheldon wants to know if there are two positive integers $X$ and $Y$ such that difference between $P$ and $X*Y$ is exactly $D$ and $GCD$(greatest common divisor) between $X$ and $Y$ must be $D$. i.e. $|P-X*Y|=D$ and $gcd(X,Y)=D$.

The problem will be given to Penny every night. If she gives the correct answer, Sheldon will take the bus next morning. Otherwise she will have to get up early and she doesn’t want ruin her precious sleep. So, she hires you to write a program which will give correct answer to the above problem.

## Input

The first line contains an integer $T(1 \leq T \leq 10^5)$-the number of tests.

The following $T$ lines describe the tests.

Each test contains two positive integers $P(1 \leq P \leq 10^{18})$ and $D(1 \leq D.

## Output

For each test case, in single line print $No$ if there are no such $X$ and $Y$ which fulfill Sheldon’s conditions else print $Yes$.

## Sample

InputOutput
2
20 4
23 5

Yes
No