Chef hosts a party for his birthday. There are N people at the party. All these N people decide to play Jenga.

There are X Jenga tiles available. In one round, all the players pick 1 tile each and place it in the tower.  
The game is *valid* if:
All the players have a tile in each round;
All the tiles are used at the end.

Given N and X, find whether the game is *valid*.

------ Input Format ------ 

- First line will contain T, the number of test cases. Then the test cases follow.
- Each test case contains a single line of input, containing two space-separated integers N and X representing the number of people at the party and the number of available tiles respectively.

------ Output Format ------ 

For each test case, output in a single line \texttt{YES} if the game is valid, else output \texttt{NO}.

You may print each character of the string in uppercase or lowercase (for example, the strings \texttt{YeS}, \texttt{yEs}, \texttt{yes} and \texttt{YES} will all be treated as identical).

------ Constraints ------ 

$1 ≤ T ≤ 10^{4}$
$1 ≤ N, X ≤ 1000$

----- Sample Input 1 ------ 
3
3 3
4 2
2 4

----- Sample Output 1 ------ 
YES
NO
YES

----- explanation 1 ------ 
Test case $1$: The game will last for $1$ round after which the tiles will finish.

Test case $2$: There are not enough Jenga tiles for everyone to place.

Test case $3$: The game will last for $2$ rounds as after round $2$ all Jenga tiles are used.

Difficulty: EASY

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


t = int(input())
while t > 0:
	(n, x) = map(int, input().split())
	print('YES' if x >= n and x % n == 0 else 'NO')
	t -= 1


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


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


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


T = int(input())
for i in range(T):
	(N, X) = map(int, input().split())
	if X == N:
		print('YES')
	elif X % N == 0:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	str = input()
	str = str.split()
	if int(str[1]) % int(str[0]) == 0 and int(str[1]) >= int(str[0]):
		print('YES')
	else:
		print('NO')


T = int(input())
for i in range(T):
	(X, Y) = map(int, input().split())
	if Y % X == 0:
		print('YES')
	else:
		print('NO')


Q = int(input())
for i in range(Q):
	(x, y) = map(int, input().split())
	if x == y or y % x == 0:
		print('YES')
	else:
		print('NO')


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


t = int(input())
for _ in range(t):
	(players, tiles) = map(int, input().split())
	if tiles % players == 0:
		print('YES')
	else:
		print('NO')


T = int(input())
while T > 0:
	(N, X) = map(int, input().split())
	if X % N == 0:
		print('YES')
	else:
		print('NO')
	T = T - 1


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