stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

typedef long long ll;

using namespace std;

#define fi0 for(ll i=0;i<n;i++)

void solve()

{

    int n,m;

    cin>>n>>m;

    if(n==m){

        cout<<"Yes\n";

    }

    else{

        cout<<"No\n";

    }

}

int main()

{

   /// int t;cin>>t;while(t--){

        solve();



}


// Faster C++ solution for the same problem (measured speedup: 5.292390649974196x):
#include <stdio.h>



int main()

{

    int N, M;

    scanf("%d%d", &N,&M);

    if (N == M){

        printf("Yes");

    }

    else {

        printf("No");

    }



}
// Slower C++ solution:
//BISMILLAHIR RAHMANIR RAHIM



#include <bits/stdc++.h>

#define loop(i,n) for(int i=0;i<n;i++)

#define pi acos(-1.00)



using namespace std;







int main()

{

    int n,m;

    cin>>n>>m;

    if(n==m)

        cout<<"Yes"<<endl;

    else

        cout<<"No"<<endl;







}




// Faster C++ solution for the same problem (measured speedup: 5.312841588959272x):
#include <stdio.h>



int main()

{

    int N, M;

    scanf("%d%d", &N,&M);

    if (N == M){

        printf("Yes");

    }

    else {

        printf("No");

    }



}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int n,m;

    cin>>n>>m;

    if(n==m){cout<<"Yes"<<endl;}

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

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.315528672051618x):
#include  <stdio.h>



int main()

{

    int N,M;

    scanf("%d", &N);

    scanf("%d", &M);

    

    if(N == M){

        printf("Yes\n");

    } else{

        printf("No\n");

    }

    

    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main() {



    int n,m;

    cin>>n>>m;

    n==m?cout<<"Yes"<<endl:cout<<"No"<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.315528672051618x):
#include  <stdio.h>



int main()

{

    int N,M;

    scanf("%d", &N);

    scanf("%d", &M);

    

    if(N == M){

        printf("Yes\n");

    } else{

        printf("No\n");

    }

    

    return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main() {

	int n,m;

	cin>>n>>m;

	if(n==m){

	    cout<<"Yes"<<endl;

	}

	else{

	    cout<<"No"<<endl;

	}

	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.315528672051618x):
#include  <stdio.h>



int main()

{

    int N,M;

    scanf("%d", &N);

    scanf("%d", &M);

    

    if(N == M){

        printf("Yes\n");

    } else{

        printf("No\n");

    }

    

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

      ios::sync_with_stdio(false);

      cin.tie(0);

    int n,m;

    cin>>n>>m;

    if(n==m){

        cout<<"Yes";

    }

    else

        cout<<"No";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.379134744525493x):
#include  <stdio.h>



int main()

{

    int N,M;

    scanf("%d", &N);

    scanf("%d", &M);

    

    if(N == M){

        printf("Yes\n");

    } else{

        printf("No\n");

    }

    

    return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int N,M;

    cin>>N>>M;

    if(N==M){

        cout<<"Yes";

    }else{

        cout<<"No";

    }

return 0;}


// Faster C++ solution for the same problem (measured speedup: 5.301796370005583x):
#include  <stdio.h>



int main()

{

    int N,M;

    scanf("%d", &N);

    scanf("%d", &M);

    

    if(N == M){

        printf("Yes\n");

    } else{

        printf("No\n");

    }

    

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

typedef long long ll;

using namespace std;

#define fi0 for(ll i=0;i<n;i++)

void solve()

{

    int n,m;

    cin>>n>>m;

    if(n==m){

        cout<<"Yes\n";

    }

    else{

        cout<<"No\n";

    }

}

int main()

{

   /// int t;cin>>t;while(t--){

        solve();



}


// Faster C++ solution for the same problem (measured speedup: 5.29506738956741x):
#include  <stdio.h>



int main()

{

    int N,M;

    scanf("%d", &N);

    scanf("%d", &M);

    

    if(N == M){

        printf("Yes\n");

    } else{

        printf("No\n");

    }

    

    return 0;

}
// Slower C++ solution:
//BISMILLAHIR RAHMANIR RAHIM



#include <bits/stdc++.h>

#define loop(i,n) for(int i=0;i<n;i++)

#define pi acos(-1.00)



using namespace std;







int main()

{

    int n,m;

    cin>>n>>m;

    if(n==m)

        cout<<"Yes"<<endl;

    else

        cout<<"No"<<endl;







}




// Faster C++ solution for the same problem (measured speedup: 5.315528672051618x):
#include  <stdio.h>



int main()

{

    int N,M;

    scanf("%d", &N);

    scanf("%d", &M);

    

    if(N == M){

        printf("Yes\n");

    } else{

        printf("No\n");

    }

    

    return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int n,m;

    cin>>n>>m;

    if(n==m){cout<<"Yes"<<endl;}

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

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.328136880339975x):
#include<stdio.h>



int main(){

	

	int N, M;

	scanf("%d %d", &N, &M);

	(N == M) ? puts("Yes") : puts("No");

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main() {



    int n,m;

    cin>>n>>m;

    n==m?cout<<"Yes"<<endl:cout<<"No"<<endl;



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.328136880339975x):
#include<stdio.h>



int main(){

	

	int N, M;

	scanf("%d %d", &N, &M);

	(N == M) ? puts("Yes") : puts("No");

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main() {

	int n,m;

	cin>>n>>m;

	if(n==m){

	    cout<<"Yes"<<endl;

	}

	else{

	    cout<<"No"<<endl;

	}

	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.328136880339975x):
#include<stdio.h>



int main(){

	

	int N, M;

	scanf("%d %d", &N, &M);

	(N == M) ? puts("Yes") : puts("No");

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

      ios::sync_with_stdio(false);

      cin.tie(0);

    int n,m;

    cin>>n>>m;

    if(n==m){

        cout<<"Yes";

    }

    else

        cout<<"No";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.391893823716752x):
#include<stdio.h>



int main(){

	

	int N, M;

	scanf("%d %d", &N, &M);

	(N == M) ? puts("Yes") : puts("No");

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int N,M;

    cin>>N>>M;

    if(N==M){

        cout<<"Yes";

    }else{

        cout<<"No";

    }

return 0;}


// Faster C++ solution for the same problem (measured speedup: 5.314372005856623x):
#include<stdio.h>



int main(){

	

	int N, M;

	scanf("%d %d", &N, &M);

	(N == M) ? puts("Yes") : puts("No");

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

typedef long long ll;

using namespace std;

#define fi0 for(ll i=0;i<n;i++)

void solve()

{

    int n,m;

    cin>>n>>m;

    if(n==m){

        cout<<"Yes\n";

    }

    else{

        cout<<"No\n";

    }

}

int main()

{

   /// int t;cin>>t;while(t--){

        solve();



}


// Faster C++ solution for the same problem (measured speedup: 5.307627064562594x):
#include<stdio.h>



int main(){

	

	int N, M;

	scanf("%d %d", &N, &M);

	(N == M) ? puts("Yes") : puts("No");

	

	return 0;

}
// Slower C++ solution:
//BISMILLAHIR RAHMANIR RAHIM



#include <bits/stdc++.h>

#define loop(i,n) for(int i=0;i<n;i++)

#define pi acos(-1.00)



using namespace std;







int main()

{

    int n,m;

    cin>>n>>m;

    if(n==m)

        cout<<"Yes"<<endl;

    else

        cout<<"No"<<endl;







}




// Faster C++ solution for the same problem (measured speedup: 5.328136880339975x):
#include<stdio.h>



int main(){

	

	int N, M;

	scanf("%d %d", &N, &M);

	(N == M) ? puts("Yes") : puts("No");

	

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int N ,M;

    cin>>N>>M;

    if (M==N)

        cout<<"Yes";

    else

        cout<<"No";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.299521837928791x):
#include<stdio.h>

 

int main()

{

	int n,m;

	scanf("%d %d", &n, &m);

	if(n == m){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

 

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;



int main(){



 int n,m;

    cin>>n>>m;

    if(n==m){

    cout<<"Yes";}

    

    else if(n!=m){

    cout<<"No";}









}

// Faster C++ solution for the same problem (measured speedup: 5.299521837928791x):
#include<stdio.h>

 

int main()

{

	int n,m;

	scanf("%d %d", &n, &m);

	if(n == m){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

 

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main ()

{

    int n,m;

    cin>>n>>m;

    if (n==m)

        cout<<"Yes"<<endl;

    else

        cout<<"No"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.313248248658126x):
#include<stdio.h>

 

int main()

{

	int n,m;

	scanf("%d %d", &n, &m);

	if(n == m){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

 

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int n,m;

    cin>>n>>m;

    if(n==m)

        cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.313248248658126x):
#include<stdio.h>

 

int main()

{

	int n,m;

	scanf("%d %d", &n, &m);

	if(n == m){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

 

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    long long n,m;

    cin>>n>>m;

    if(n==m)

    {

        cout<<"Yes"<<endl;

    }

    else

    {

        cout<<"No"<<endl;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.311124837307235x):
#include<stdio.h>

 

int main()

{

	int n,m;

	scanf("%d %d", &n, &m);

	if(n == m){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

 

	return 0;

}
// Slower C++ solution:
//Code by ASIM FOIZE AIMON

//CSE'19;CUET

//avoid copy paste//Hit the frined button

#include <bits/stdc++.h>

using namespace std;

#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);

#define precise cout.precision(10); cout << fixed;

#define endl "\n"

#define int int64_t

#define ll long long

#define yes printf("Yes\n")

#define no printf("No\n")

#define push_back pb

int32_t main()

{

    /*#ifndef ONLINE_JUDGE

        freopen("/media/AIMON/SSDVol/Progs/CodeForces/input.txt", "r", stdin);

        freopen("/media/AIMON/SSDVol/Progs/CodeForces/output.txt", "w", stdout);

    #endif*/

    int i,t,n,m;

    cin>>n>>m;

    if(n==m)

        yes;

    else

        no;

}


// Faster C++ solution for the same problem (measured speedup: 5.243964966123451x):
#include<stdio.h>

 

int main()

{

	int n,m;

	scanf("%d %d", &n, &m);

	if(n == m){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

 

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define gcd(a,b)   __gcd(a,b)

#define lcm(a,b)   (a*b)/gcd

#define rep(i,n)   for(int i=0;i<n;i++)

#define Rep(i,n)   for(int i=1;i<=n;i++)

#define REP(i,j,n) for(int i=j;i<=n;i++)

#define fast   ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)





int main()

{ 

	fast;

	ll n,m;

	cin>>n>>m;

	if(n==m){

		cout<<"Yes"<<endl;

	}

	else cout<<"No"<<endl;

	return 0;



}

// Faster C++ solution for the same problem (measured speedup: 5.38488687433998x):
#include<stdio.h>

 

int main()

{

	int n,m;

	scanf("%d %d", &n, &m);

	if(n == m){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

 

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int N ,M;

    cin>>N>>M;

    if (M==N)

        cout<<"Yes";

    else

        cout<<"No";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.299521837928791x):
#include <stdio.h>



int main(){

	int N,M;

	

	scanf("%d %d", &N,&M);

	if(N == M){

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;



int main(){



 int n,m;

    cin>>n>>m;

    if(n==m){

    cout<<"Yes";}

    

    else if(n!=m){

    cout<<"No";}









}

// Faster C++ solution for the same problem (measured speedup: 5.299521837928791x):
#include <stdio.h>



int main(){

	int N,M;

	

	scanf("%d %d", &N,&M);

	if(N == M){

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main ()

{

    int n,m;

    cin>>n>>m;

    if (n==m)

        cout<<"Yes"<<endl;

    else

        cout<<"No"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.313248248658126x):
#include <stdio.h>



int main(){

	int N,M;

	

	scanf("%d %d", &N,&M);

	if(N == M){

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int n,m;

    cin>>n>>m;

    if(n==m)

        cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.313248248658126x):
#include <stdio.h>



int main(){

	int N,M;

	

	scanf("%d %d", &N,&M);

	if(N == M){

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    long long n,m;

    cin>>n>>m;

    if(n==m)

    {

        cout<<"Yes"<<endl;

    }

    else

    {

        cout<<"No"<<endl;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.311124837307235x):
#include <stdio.h>



int main(){

	int N,M;

	

	scanf("%d %d", &N,&M);

	if(N == M){

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
//Code by ASIM FOIZE AIMON

//CSE'19;CUET

//avoid copy paste//Hit the frined button

#include <bits/stdc++.h>

using namespace std;

#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);

#define precise cout.precision(10); cout << fixed;

#define endl "\n"

#define int int64_t

#define ll long long

#define yes printf("Yes\n")

#define no printf("No\n")

#define push_back pb

int32_t main()

{

    /*#ifndef ONLINE_JUDGE

        freopen("/media/AIMON/SSDVol/Progs/CodeForces/input.txt", "r", stdin);

        freopen("/media/AIMON/SSDVol/Progs/CodeForces/output.txt", "w", stdout);

    #endif*/

    int i,t,n,m;

    cin>>n>>m;

    if(n==m)

        yes;

    else

        no;

}


// Faster C++ solution for the same problem (measured speedup: 5.243964966123451x):
#include <stdio.h>



int main(){

	int N,M;

	

	scanf("%d %d", &N,&M);

	if(N == M){

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define gcd(a,b)   __gcd(a,b)

#define lcm(a,b)   (a*b)/gcd

#define rep(i,n)   for(int i=0;i<n;i++)

#define Rep(i,n)   for(int i=1;i<=n;i++)

#define REP(i,j,n) for(int i=j;i<=n;i++)

#define fast   ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)





int main()

{ 

	fast;

	ll n,m;

	cin>>n>>m;

	if(n==m){

		cout<<"Yes"<<endl;

	}

	else cout<<"No"<<endl;

	return 0;



}

// Faster C++ solution for the same problem (measured speedup: 5.38488687433998x):
#include <stdio.h>



int main(){

	int N,M;

	

	scanf("%d %d", &N,&M);

	if(N == M){

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int N ,M;

    cin>>N>>M;

    if (M==N)

        cout<<"Yes";

    else

        cout<<"No";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.299521837928791x):
#include<stdio.h>

	

	int main (){

		int a,b;

		

		scanf("%d %d", &a,&b);

		if (a==b){

			printf("Yes\n");

		

		}else

			printf("No\n");

		

		return 0;

	}
// Slower C++ solution:
#include<iostream>

using namespace std;



int main(){



 int n,m;

    cin>>n>>m;

    if(n==m){

    cout<<"Yes";}

    

    else if(n!=m){

    cout<<"No";}









}

// Faster C++ solution for the same problem (measured speedup: 5.299521837928791x):
#include<stdio.h>

	

	int main (){

		int a,b;

		

		scanf("%d %d", &a,&b);

		if (a==b){

			printf("Yes\n");

		

		}else

			printf("No\n");

		

		return 0;

	}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main ()

{

    int n,m;

    cin>>n>>m;

    if (n==m)

        cout<<"Yes"<<endl;

    else

        cout<<"No"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.313248248658126x):
#include<stdio.h>

	

	int main (){

		int a,b;

		

		scanf("%d %d", &a,&b);

		if (a==b){

			printf("Yes\n");

		

		}else

			printf("No\n");

		

		return 0;

	}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int n,m;

    cin>>n>>m;

    if(n==m)

        cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.313248248658126x):
#include<stdio.h>

	

	int main (){

		int a,b;

		

		scanf("%d %d", &a,&b);

		if (a==b){

			printf("Yes\n");

		

		}else

			printf("No\n");

		

		return 0;

	}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    long long n,m;

    cin>>n>>m;

    if(n==m)

    {

        cout<<"Yes"<<endl;

    }

    else

    {

        cout<<"No"<<endl;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.311124837307235x):
#include<stdio.h>

	

	int main (){

		int a,b;

		

		scanf("%d %d", &a,&b);

		if (a==b){

			printf("Yes\n");

		

		}else

			printf("No\n");

		

		return 0;

	}
// Slower C++ solution:
//Code by ASIM FOIZE AIMON

//CSE'19;CUET

//avoid copy paste//Hit the frined button

#include <bits/stdc++.h>

using namespace std;

#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);

#define precise cout.precision(10); cout << fixed;

#define endl "\n"

#define int int64_t

#define ll long long

#define yes printf("Yes\n")

#define no printf("No\n")

#define push_back pb

int32_t main()

{

    /*#ifndef ONLINE_JUDGE

        freopen("/media/AIMON/SSDVol/Progs/CodeForces/input.txt", "r", stdin);

        freopen("/media/AIMON/SSDVol/Progs/CodeForces/output.txt", "w", stdout);

    #endif*/

    int i,t,n,m;

    cin>>n>>m;

    if(n==m)

        yes;

    else

        no;

}


// Faster C++ solution for the same problem (measured speedup: 5.243964966123451x):
#include<stdio.h>

	

	int main (){

		int a,b;

		

		scanf("%d %d", &a,&b);

		if (a==b){

			printf("Yes\n");

		

		}else

			printf("No\n");

		

		return 0;

	}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define gcd(a,b)   __gcd(a,b)

#define lcm(a,b)   (a*b)/gcd

#define rep(i,n)   for(int i=0;i<n;i++)

#define Rep(i,n)   for(int i=1;i<=n;i++)

#define REP(i,j,n) for(int i=j;i<=n;i++)

#define fast   ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)





int main()

{ 

	fast;

	ll n,m;

	cin>>n>>m;

	if(n==m){

		cout<<"Yes"<<endl;

	}

	else cout<<"No"<<endl;

	return 0;



}

// Faster C++ solution for the same problem (measured speedup: 5.38488687433998x):
#include<stdio.h>

	

	int main (){

		int a,b;

		

		scanf("%d %d", &a,&b);

		if (a==b){

			printf("Yes\n");

		

		}else

			printf("No\n");

		

		return 0;

	}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int N ,M;

    cin>>N>>M;

    if (M==N)

        cout<<"Yes";

    else

        cout<<"No";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.299521837928791x):
#include<stdio.h>



 int main (){

	int n,m;

	

	scanf("%d %d", &n, &m);

	if(n==m){

 	printf("Yes\n");

	}	

	else

 	printf("No\n");



  return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;



int main(){



 int n,m;

    cin>>n>>m;

    if(n==m){

    cout<<"Yes";}

    

    else if(n!=m){

    cout<<"No";}









}

// Faster C++ solution for the same problem (measured speedup: 5.299521837928791x):
#include<stdio.h>



 int main (){

	int n,m;

	

	scanf("%d %d", &n, &m);

	if(n==m){

 	printf("Yes\n");

	}	

	else

 	printf("No\n");



  return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main ()

{

    int n,m;

    cin>>n>>m;

    if (n==m)

        cout<<"Yes"<<endl;

    else

        cout<<"No"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.313248248658126x):
#include<stdio.h>



 int main (){

	int n,m;

	

	scanf("%d %d", &n, &m);

	if(n==m){

 	printf("Yes\n");

	}	

	else

 	printf("No\n");



  return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int n,m;

    cin>>n>>m;

    if(n==m)

        cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.313248248658126x):
#include<stdio.h>



 int main (){

	int n,m;

	

	scanf("%d %d", &n, &m);

	if(n==m){

 	printf("Yes\n");

	}	

	else

 	printf("No\n");



  return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    long long n,m;

    cin>>n>>m;

    if(n==m)

    {

        cout<<"Yes"<<endl;

    }

    else

    {

        cout<<"No"<<endl;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.311124837307235x):
#include<stdio.h>



 int main (){

	int n,m;

	

	scanf("%d %d", &n, &m);

	if(n==m){

 	printf("Yes\n");

	}	

	else

 	printf("No\n");



  return 0;

}
// Slower C++ solution:
//Code by ASIM FOIZE AIMON

//CSE'19;CUET

//avoid copy paste//Hit the frined button

#include <bits/stdc++.h>

using namespace std;

#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);

#define precise cout.precision(10); cout << fixed;

#define endl "\n"

#define int int64_t

#define ll long long

#define yes printf("Yes\n")

#define no printf("No\n")

#define push_back pb

int32_t main()

{

    /*#ifndef ONLINE_JUDGE

        freopen("/media/AIMON/SSDVol/Progs/CodeForces/input.txt", "r", stdin);

        freopen("/media/AIMON/SSDVol/Progs/CodeForces/output.txt", "w", stdout);

    #endif*/

    int i,t,n,m;

    cin>>n>>m;

    if(n==m)

        yes;

    else

        no;

}


// Faster C++ solution for the same problem (measured speedup: 5.243964966123451x):
#include<stdio.h>



 int main (){

	int n,m;

	

	scanf("%d %d", &n, &m);

	if(n==m){

 	printf("Yes\n");

	}	

	else

 	printf("No\n");



  return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define gcd(a,b)   __gcd(a,b)

#define lcm(a,b)   (a*b)/gcd

#define rep(i,n)   for(int i=0;i<n;i++)

#define Rep(i,n)   for(int i=1;i<=n;i++)

#define REP(i,j,n) for(int i=j;i<=n;i++)

#define fast   ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)





int main()

{ 

	fast;

	ll n,m;

	cin>>n>>m;

	if(n==m){

		cout<<"Yes"<<endl;

	}

	else cout<<"No"<<endl;

	return 0;



}

// Faster C++ solution for the same problem (measured speedup: 5.38488687433998x):
#include<stdio.h>



 int main (){

	int n,m;

	

	scanf("%d %d", &n, &m);

	if(n==m){

 	printf("Yes\n");

	}	

	else

 	printf("No\n");



  return 0;

}