# PROBLEM LINK:

Contest Division 1

Contest Division 2

Contest Division 3

Contest Division 4

Setter: Kanhaiya Mohan

Tester: Istvan Nagy, Aryan

Editorialist: Vijay

# DIFFICULTY:

Cakewalk

# PREREQUISITES:

None

# PROBLEM:

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

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

# EXPLANATION

We will try to manipulate the maximum number of guards. We are given in the problem that the maximum number of guards Ezio can manipulate is X. Thus if X comes out be less than Y. We will not be able to manipulate all of the guards otherwise we can always manipulate all of them.

# TIME COMPLEXITY:

O(1) per test case

# SOLUTION:

## Editorialist's Solution

```
#include <bits/stdc++.h>
using namespace std;
#define nline '\n'
void solve()
{
int x, y;
cin>>x>>y;
if(x>=y)cout<<"YES"<<nline;
else cout<<"NO"<<nline;
}
int main()
{
int t=1;
cin >> t;
while (t--)
{
solve();
}
}
```