Problem:
Score : 100 points

Problem Statement

Takahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.

The problem has N test cases, all of which must be passed to get an AC verdict.

Takahashi's submission has passed M cases out of the N test cases.

Determine whether Takahashi's submission gets an AC.

Constraints

1 \leq N \leq 100

0 \leq M \leq N

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N M

Output

If Takahashi's submission gets an AC, print Yes; otherwise, print No.

Sample Input 1

3 3

Sample Output 1

Yes

All three test cases have been passed, so his submission gets an AC.

Sample Input 2

3 2

Sample Output 2

No

Only two out of the three test cases have been passed, so his submission does not get an AC.

Sample Input 3

1 1

Sample Output 3

Yes

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include<bits/stdc++.h>
 
using namespace std;
 
#define pb push_back
#define mk make_pair
#define mod 1000000007
#define ff first
#define ss second
 
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
ll modpow(ll a, ll b){
 
    ll ans=1;
    while(b){
        if(b&1){
            ans=(ans*a)%mod;
        }
        a=(a*a)%mod;
        b=b/2;
    }
    return ans;
}
 
 
int main(){
 
    cin.tie(0);
    ios::sync_with_stdio(false);
 
    int n,m;
    cin>>n>>m;
 
    if(n == m) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
 
 
}