#include<bits/stdc++.h>
using namespace std;

#define FAST1 ios_base::sync_with_stdio(false);
#define FAST2 cin.tie(NULL);
#define ff              first
#define ss              second
#define ll              long long
#define pb              push_back
#define mp              make_pair
#define mt              make_tuple
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define range(a,b)      substr(a,b-a+1)
#define w(x)            long long int x; cin>>x; while(x--)
#define trace(x)        cerr<<#x<<": "<<x<<" "<<endl;
#define FIO             ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define all(c) c.begin(), c.end()


bool prime(ll a)
{
    if (a==1) return 0;

    for (int i=2;i<=round(sqrt(a));++i)
    {
        if (a%i==0) return 0;
    }
    return 1;
}

ll min(ll a,int b)
{
    if (a<b) return a;
    return b;
}
 

ll min(int a,ll b)
{
    if (a<b) return a;
    return b;
}
 

ll max(ll a,int b)
{
    if (a>b) return a;
    return b;
}
 

ll max(int a,ll b)
{
    if (a>b) return a;
    return b;
}
 

ll gcd(ll a,ll b)
{
    if (b==0) return a;
    return gcd(b,a%b);
}
 
int countDigits(int n)
{
    int count=0;
    while(n>0)
    {
        n/=10;
        count++;
    }
    return count;
 
}

ll lcm(ll a,ll b)
{
    return a/gcd(a,b)*b;
}


bool isPerfectSquare(long double x)
{
    
    if (x >= 0) {
 
        long long sr = sqrt(x);
         
        return (sr * sr == x);
    }
    // else return false if n<0
    return false;
}
 
bool cmp(pair<ll,ll>a, pair<ll,ll>b)
{

    if(a.ff > b.ff)
    {
        return true;
    }

    else if(a.ff == b.ff)
    {
        if(a.ss > b.ss)
        {
            return true;
        }
    }
    return false;
}

void solve_without_test_cases()
{
    int b, c;
    cin >> b >> c;
    
    if (b == c)
    {
        cout << "Yes" << endl;
    }

    else 
    {
        cout << "No" << endl;
    }
}

void solve_while_test_cases()
{

}


int main()
{

    solve_without_test_cases();
    // int test; 
    // cin>>test;
    
    // while(test--)
    // {
    //     solve_while_test_cases();
    // }
    return 0;
}