You are given two integers $n$ and $m$ ($m < n$). Consider a convex regular polygon of $n$ vertices. Recall that a regular polygon is a polygon that is equiangular (all angles are equal in measure) and equilateral (all sides have the same length). [Image] Examples of convex regular polygons 

Your task is to say if it is possible to build another convex regular polygon with $m$ vertices such that its center coincides with the center of the initial polygon and each of its vertices is some vertex of the initial polygon.

You have to answer $t$ independent test cases.


-----Input-----

The first line of the input contains one integer $t$ ($1 \le t \le 10^4$) — the number of test cases.

The next $t$ lines describe test cases. Each test case is given as two space-separated integers $n$ and $m$ ($3 \le m < n \le 100$) — the number of vertices in the initial polygon and the number of vertices in the polygon you want to build.


-----Output-----

For each test case, print the answer — "YES" (without quotes), if it is possible to build another convex regular polygon with $m$ vertices such that its center coincides with the center of the initial polygon and each of its vertices is some vertex of the initial polygon and "NO" otherwise.


-----Example-----
Input
2
6 3
7 3

Output
YES
NO



-----Note----- $0$ The first test case of the example 

It can be shown that the answer for the second test case of the example is "NO".

Difficulty: interview

Starter code:

Solutions:
t = int(input())
for tt in range(t):
	x, y = map(int, input().split())
	print('YES' if x % y == 0 else "NO")

import sys
import math
import itertools
import functools
import collections
import operator
import fileinput
import copy


ORDA = 97
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return list(map(int, input().split()))
def lcm(a, b): return abs(a * b) // math.gcd(a, b)
def revn(n): return str(n)[::-1]
def dd(): return collections.defaultdict(int)
def ddl(): return collections.defaultdict(list)
def sieve(n):
    if n < 2: return list()
    prime = [True for _ in range(n + 1)]
    p = 3
    while p * p <= n:
        if prime[p]:
            for i in range(p * 2, n + 1, p):
                prime[i] = False
        p += 2
    r = [2]
    for p in range(3, n + 1, 2):
        if prime[p]:
            r.append(p)
    return r
def divs(n, start=1):
    r = []
    for i in range(start, int(math.sqrt(n) + 1)):
        if (n % i == 0):
            if (n / i == i):
                r.append(i)
            else:
                r.extend([i, n // i])
    return r
def divn(n, primes):
    divs_number = 1
    for i in primes:
        if n == 1:
            return divs_number
        t = 1
        while n % i == 0:
            t += 1
            n //= i
        divs_number *= t
def prime(n):
    if n == 2: return True
    if n % 2 == 0 or n <= 1: return False
    sqr = int(math.sqrt(n)) + 1
    for d in range(3, sqr, 2):
        if n % d == 0: return False
    return True
def convn(number, base):
    newnumber = 0
    while number > 0:
        newnumber += number % base
        number //= base
    return newnumber
def cdiv(n, k): return n // k + (n % k != 0)


for _ in range(ii()):
    n, m = mi()
    print('NO') if n % m else print('YES')

from math import *

zzz = int(input())
for zz in range(zzz):
    n, m = list(map(int, input().split()))
    print('YES' if n/m == int(n/m)else 'NO' )



for i in range(int(input())):
    n, m = list(map(int, input().split()))
    if n % m == 0:
        print('YES')
    else:
        print('NO')

n = int(input())
for i in range(n):
    a,b = list(map(int,input().split()))
    if a % b == 0:
        print('YES')
    else:
        print('NO')


for _ in range(int(input())):
    n, m = map(int, input().split())
    if n % m:
        print('NO')
    else:
        print('YES')

t = int(input())
for i in range(t):
	n,m = list(map(int, input().split()))
	if n % m == 0:
		print ("YES")
	else:
		print ("NO")


t = int(input())
for i in range(t):
    a, b = map(int, input().split())
    if (a % b == 0):
        print('YES')
    else:
        print('NO')



for _ in range(int(input())):
	n,m=map(int,input().split())

	if(n%m==0):
		print("YES")
	else:
		print("NO")

n = int(input())
for i in range(n):
    a, b = list(map(int, input().split()))
    if a % b == 0:
        print("YES")
    else:
        print("NO")

import math, collections, sys
input = sys.stdin.readline
def solve():
    n, m= map(int, input().split())
    if n%m:
        print("NO")
    else:
        print("YES")
for _ in range(int(input())):
    solve()

q = int(input())
for irweewr in range(q):
	n, m = map(int,input().split())
	if n%m == 0:
		print("YES")
	else:
		print("NO")