# Ezio and Guards solution codechef

## Ezio and Guards solution codechef

Ezio can manipulate at most XX number of guards with the apple of eden.

Given that there are YY number of guards, predict if he can safely manipulate all of them.

### Ezio and Guards solution codechef

• First line will contain TT, number of test cases. Then the test cases follow.
• Each test case contains of a single line of input, two integers XX and YY.

### Output Format

For each test case, print YESYES if it is possible for Ezio to manipulate all the guards. Otherwise, print NONO.

You may print each character of the string in uppercase or lowercase (for example, the strings YeSYeSyEsyEsyesyes and YESYES will all be treated as identical).

### Ezio and Guards solution codechef

• 1T1001≤T≤100
• 1X,Y1001≤X,Y≤100

### Sample Input 1

3
5 7
6 6
9 1


Ezio and Guards solution codechef

NO
YES
YES


### Explanation

Test Case 11: Ezio can manipulate at most 55 guards. Since there are 77 guards, he cannot manipulate all of them.

Test Case 22: Ezio can manipulate at most 66 guards. Since there are 66 guards, he can manipulate all of them.

Test Case 33: Ezio can manipulate at most 99 guards. Since there is only 11 guard, he can manipulate the guard.