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

using namespace std;

int main()

{

    int m,n;

    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.328308546803833x):
#include <stdio.h>



int main() {

  int n, m;

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

  if(n == m) puts("Yes");

  else puts("No");

  return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;





#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);  ///for fasting input and output using cin,cout(only)

#define endl '\n'



int main()



{

    optimize();

    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.384877811901328x):
#include <stdio.h>



int main() {

  int n, m;

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

  if(n == m) puts("Yes");

  else 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\n";

     }

     else{

        cout<<"No\n";

     }



     return 0;

 }


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



int main() {

  int n, m;

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

  if(n == m) puts("Yes");

  else puts("No");

  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;

    }

}


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



int main() {

  int n, m;

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

  if(n == m) puts("Yes");

  else puts("No");

  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";

    else

        cout << "No";



    return 0;

}


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



int main() {

  int n, m;

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

  if(n == m) puts("Yes");

  else puts("No");

  return 0;

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

#define ll long long int

using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);



ll n,m,x,k,d,i,j,index,flag=0,count=0,result,odd,even,sum=0,temp,mini;

cin>>n>>m;

//string str;

//cin>>str;

//ll a[200005];

//ll b[200005];

/*for(i=0;i<n;i++)

{

    cin>>a[i];

}

*/

if(n==m)  cout<<"Yes";

else cout<<"No";



    return 0;

}


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



int main() {

  int n, m;

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

  if(n == m) puts("Yes");

  else puts("No");

  return 0;

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

using namespace std;

int main()

{

    int a,b;

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

    if(a==b)

        printf("Yes");

    else

        printf("No");

}


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



int main() {

  int n, m;

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

  if(n == m) puts("Yes");

  else 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\n";

    else cout<<"No\n";

}


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



int main() {

  int n, m;

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

  if(n == m) puts("Yes");

  else puts("No");

  return 0;

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

#include<stdio.h>

#include<vector>

#include<algorithm>

#include<iterator>

#include<math.h>

#include<cstring>

using namespace std;

void lets_play()



{

   int n,m;

   cin>>n>>m;



  if(m==n)

    cout<<"Yes"<<endl;

  else

    cout<<"No"<<endl;

    }



int main()

{

        lets_play();



}


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



int main() {

  int n, m;

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

  if(n == m) puts("Yes");

  else puts("No");

  return 0;

}
// Slower C++ solution:
//Tanzim bin nasir

#include<bits/stdc++.h>

typedef long long ll;

#define ff first

#define ss second

using namespace std;

void fast()

{

ios::sync_with_stdio(false);

cin.tie(NULL); cout.tie(NULL);

}

ll gcd(ll a,ll b)

{

    if(b==0)

    return a;

    else

    gcd(b,a%b);

}

ll lcd(ll a,ll b)

{

    return (a*b)/gcd(a,b);

}

int main()

{

    int n,m;

    cin>>n>>m;

    if(m==n)

    cout<<"Yes\n";

    else

    cout<<"No\n";

}


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



int main() {

  int n, m;

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

  if(n == m) puts("Yes");

  else puts("No");

  return 0;

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

int main(){

    int n , m;

    std :: cin >> n >> m;

    if (n==m) std :: cout << "Yes";

    else std:: cout << "No";

    return 0;

}


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

int main(){

	int n;

	int m;

	

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

	if(n==m){

		printf("Yes");

	}

	else{

		printf("No");

	}

	

	

	return 0;

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

using namespace std;



#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define mt make_tuple

#define eb emplace_back

#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)



#define LB(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())

#define UB(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())

typedef long long ll;

typedef pair<ll,ll> ii;

typedef vector<int> vi;

typedef vector<ll> vl;

typedef unsigned long long ull;

typedef long double ld; 

typedef tuple<int,int,int> State;



ll mod = 1e9 + 7;



#define citc(tc) int tc; cin>>tc; while(tc--){solve();}

#define each(a,x) for( auto &a:(x))

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

#define repr(i, n) for (ll i = (n) - 1; i >= 0; i--)

#define rep2(i, l, r) for (ll i = (l); i < (r); i++)

#define rep2r(i, l, r) for (ll i = (r) - 1; i >= (l); i--)

#define range(a) a.begin(), a.end()

#define deb(x) cout<<#x<<" "<<x<<endl;

#define cini(i) int i; cin>>i;

#define cinll(l) ll l; cin>>l;

#define cinai(a, n) vi a(n); rep(i, n) { cin>>a[i]; }

#define cinal(a, n) vl a(n); rep(i, n) { cin>>a[i]; }

#define coutai(a, n) rep(i, n) { cout<<a[i]<<" "; } ent;

#define coutal(a, n) rep(i, n) { cout<<a[i]<<" "; } ent;

#define ent cout<<endl;



void solve()

{

	ll a, b;

	cin>>a>>b;

	if(a == b)

		cout<<"Yes\n";

	else

		cout<<"No\n";

}

int main()

{

	fastio();

	// citc(tc);

	solve();

}

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

int main(){

	int n;

	int m;

	

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

	if(n==m){

		printf("Yes");

	}

	else{

		printf("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.298824304483233x):
#include<stdio.h>

int main(){

	int n;

	int m;

	

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

	if(n==m){

		printf("Yes");

	}

	else{

		printf("No");

	}

	

	

	return 0;

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

using namespace std;

int main()

{

    int m,n;

    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.31262692896587x):
#include<stdio.h>

int main(){

	int n;

	int m;

	

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

	if(n==m){

		printf("Yes");

	}

	else{

		printf("No");

	}

	

	

	return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;





#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);  ///for fasting input and output using cin,cout(only)

#define endl '\n'



int main()



{

    optimize();

    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.369029706408073x):
#include<stdio.h>

int main(){

	int n;

	int m;

	

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

	if(n==m){

		printf("Yes");

	}

	else{

		printf("No");

	}

	

	

	return 0;

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

 using namespace std;



 int main()

 {

     int n,m;



     cin>>n>>m;



     if(n==m){

        cout<<"Yes\n";

     }

     else{

        cout<<"No\n";

     }



     return 0;

 }


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

int main(){

	int n;

	int m;

	

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

	if(n==m){

		printf("Yes");

	}

	else{

		printf("No");

	}

	

	

	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;

    }

}


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

int main(){

	int n;

	int m;

	

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

	if(n==m){

		printf("Yes");

	}

	else{

		printf("No");

	}

	

	

	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";

    else

        cout << "No";



    return 0;

}


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

int main(){

	int n;

	int m;

	

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

	if(n==m){

		printf("Yes");

	}

	else{

		printf("No");

	}

	

	

	return 0;

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

#define ll long long int

using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);



ll n,m,x,k,d,i,j,index,flag=0,count=0,result,odd,even,sum=0,temp,mini;

cin>>n>>m;

//string str;

//cin>>str;

//ll a[200005];

//ll b[200005];

/*for(i=0;i<n;i++)

{

    cin>>a[i];

}

*/

if(n==m)  cout<<"Yes";

else cout<<"No";



    return 0;

}


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

int main(){

	int n;

	int m;

	

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

	if(n==m){

		printf("Yes");

	}

	else{

		printf("No");

	}

	

	

	return 0;

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

using namespace std;

int main()

{

    int a,b;

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

    if(a==b)

        printf("Yes");

    else

        printf("No");

}


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

int main(){

	int n;

	int m;

	

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

	if(n==m){

		printf("Yes");

	}

	else{

		printf("No");

	}

	

	

	return 0;

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

using namespace std;

int main()

{

    int n,m;

    cin>>n>>m;

    if(n==m)

        cout<<"Yes\n";

    else cout<<"No\n";

}


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

int main(){

	int n;

	int m;

	

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

	if(n==m){

		printf("Yes");

	}

	else{

		printf("No");

	}

	

	

	return 0;

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

#include<stdio.h>

#include<vector>

#include<algorithm>

#include<iterator>

#include<math.h>

#include<cstring>

using namespace std;

void lets_play()



{

   int n,m;

   cin>>n>>m;



  if(m==n)

    cout<<"Yes"<<endl;

  else

    cout<<"No"<<endl;

    }



int main()

{

        lets_play();



}


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

int main(){

	int n;

	int m;

	

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

	if(n==m){

		printf("Yes");

	}

	else{

		printf("No");

	}

	

	

	return 0;

}
// Slower C++ solution:
//Tanzim bin nasir

#include<bits/stdc++.h>

typedef long long ll;

#define ff first

#define ss second

using namespace std;

void fast()

{

ios::sync_with_stdio(false);

cin.tie(NULL); cout.tie(NULL);

}

ll gcd(ll a,ll b)

{

    if(b==0)

    return a;

    else

    gcd(b,a%b);

}

ll lcd(ll a,ll b)

{

    return (a*b)/gcd(a,b);

}

int main()

{

    int n,m;

    cin>>n>>m;

    if(m==n)

    cout<<"Yes\n";

    else

    cout<<"No\n";

}


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

int main(){

	int n;

	int m;

	

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

	if(n==m){

		printf("Yes");

	}

	else{

		printf("No");

	}

	

	

	return 0;

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

int main(){

    int n , m;

    std :: cin >> n >> m;

    if (n==m) std :: cout << "Yes";

    else std:: cout << "No";

    return 0;

}


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



int main()

{

	int M;

	int N;

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

	if(M==N)

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;	

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

using namespace std;



#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define mt make_tuple

#define eb emplace_back

#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)



#define LB(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())

#define UB(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())

typedef long long ll;

typedef pair<ll,ll> ii;

typedef vector<int> vi;

typedef vector<ll> vl;

typedef unsigned long long ull;

typedef long double ld; 

typedef tuple<int,int,int> State;



ll mod = 1e9 + 7;



#define citc(tc) int tc; cin>>tc; while(tc--){solve();}

#define each(a,x) for( auto &a:(x))

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

#define repr(i, n) for (ll i = (n) - 1; i >= 0; i--)

#define rep2(i, l, r) for (ll i = (l); i < (r); i++)

#define rep2r(i, l, r) for (ll i = (r) - 1; i >= (l); i--)

#define range(a) a.begin(), a.end()

#define deb(x) cout<<#x<<" "<<x<<endl;

#define cini(i) int i; cin>>i;

#define cinll(l) ll l; cin>>l;

#define cinai(a, n) vi a(n); rep(i, n) { cin>>a[i]; }

#define cinal(a, n) vl a(n); rep(i, n) { cin>>a[i]; }

#define coutai(a, n) rep(i, n) { cout<<a[i]<<" "; } ent;

#define coutal(a, n) rep(i, n) { cout<<a[i]<<" "; } ent;

#define ent cout<<endl;



void solve()

{

	ll a, b;

	cin>>a>>b;

	if(a == b)

		cout<<"Yes\n";

	else

		cout<<"No\n";

}

int main()

{

	fastio();

	// citc(tc);

	solve();

}

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



int main()

{

	int M;

	int N;

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

	if(M==N)

	{

		printf("Yes");

	}

	else

	{

		printf("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.298824304483233x):
#include<stdio.h>



int main()

{

	int M;

	int N;

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

	if(M==N)

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;	

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

using namespace std;

int main()

{

    int m,n;

    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.31262692896587x):
#include<stdio.h>



int main()

{

	int M;

	int N;

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

	if(M==N)

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;	

}
// Slower C++ solution:


#include<bits/stdc++.h>

using namespace std;





#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);  ///for fasting input and output using cin,cout(only)

#define endl '\n'



int main()



{

    optimize();

    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.369029706408073x):
#include<stdio.h>



int main()

{

	int M;

	int N;

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

	if(M==N)

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;	

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

 using namespace std;



 int main()

 {

     int n,m;



     cin>>n>>m;



     if(n==m){

        cout<<"Yes\n";

     }

     else{

        cout<<"No\n";

     }



     return 0;

 }


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



int main()

{

	int M;

	int N;

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

	if(M==N)

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	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;

    }

}


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



int main()

{

	int M;

	int N;

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

	if(M==N)

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	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";

    else

        cout << "No";



    return 0;

}


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



int main()

{

	int M;

	int N;

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

	if(M==N)

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;	

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

#define ll long long int

using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);



ll n,m,x,k,d,i,j,index,flag=0,count=0,result,odd,even,sum=0,temp,mini;

cin>>n>>m;

//string str;

//cin>>str;

//ll a[200005];

//ll b[200005];

/*for(i=0;i<n;i++)

{

    cin>>a[i];

}

*/

if(n==m)  cout<<"Yes";

else cout<<"No";



    return 0;

}


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



int main()

{

	int M;

	int N;

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

	if(M==N)

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;	

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

using namespace std;

int main()

{

    int a,b;

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

    if(a==b)

        printf("Yes");

    else

        printf("No");

}


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



int main()

{

	int M;

	int N;

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

	if(M==N)

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;	

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

using namespace std;

int main()

{

    int n,m;

    cin>>n>>m;

    if(n==m)

        cout<<"Yes\n";

    else cout<<"No\n";

}


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



int main()

{

	int M;

	int N;

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

	if(M==N)

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;	

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

#include<stdio.h>

#include<vector>

#include<algorithm>

#include<iterator>

#include<math.h>

#include<cstring>

using namespace std;

void lets_play()



{

   int n,m;

   cin>>n>>m;



  if(m==n)

    cout<<"Yes"<<endl;

  else

    cout<<"No"<<endl;

    }



int main()

{

        lets_play();



}


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



int main()

{

	int M;

	int N;

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

	if(M==N)

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;	

}
// Slower C++ solution:
//Tanzim bin nasir

#include<bits/stdc++.h>

typedef long long ll;

#define ff first

#define ss second

using namespace std;

void fast()

{

ios::sync_with_stdio(false);

cin.tie(NULL); cout.tie(NULL);

}

ll gcd(ll a,ll b)

{

    if(b==0)

    return a;

    else

    gcd(b,a%b);

}

ll lcd(ll a,ll b)

{

    return (a*b)/gcd(a,b);

}

int main()

{

    int n,m;

    cin>>n>>m;

    if(m==n)

    cout<<"Yes\n";

    else

    cout<<"No\n";

}


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



int main()

{

	int M;

	int N;

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

	if(M==N)

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;	

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

int main(){

    int n , m;

    std :: cin >> n >> m;

    if (n==m) std :: cout << "Yes";

    else std:: cout << "No";

    return 0;

}


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



int main (){

	int num1, num2;

	scanf("%d %d", &num1, &num2);

	

	if (num1 == num2){

		printf("Yes \n", num1);

	}

	else {

		printf("No \n", num1);

	}



	return 0;

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

using namespace std;



#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define mt make_tuple

#define eb emplace_back

#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)



#define LB(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())

#define UB(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())

typedef long long ll;

typedef pair<ll,ll> ii;

typedef vector<int> vi;

typedef vector<ll> vl;

typedef unsigned long long ull;

typedef long double ld; 

typedef tuple<int,int,int> State;



ll mod = 1e9 + 7;



#define citc(tc) int tc; cin>>tc; while(tc--){solve();}

#define each(a,x) for( auto &a:(x))

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

#define repr(i, n) for (ll i = (n) - 1; i >= 0; i--)

#define rep2(i, l, r) for (ll i = (l); i < (r); i++)

#define rep2r(i, l, r) for (ll i = (r) - 1; i >= (l); i--)

#define range(a) a.begin(), a.end()

#define deb(x) cout<<#x<<" "<<x<<endl;

#define cini(i) int i; cin>>i;

#define cinll(l) ll l; cin>>l;

#define cinai(a, n) vi a(n); rep(i, n) { cin>>a[i]; }

#define cinal(a, n) vl a(n); rep(i, n) { cin>>a[i]; }

#define coutai(a, n) rep(i, n) { cout<<a[i]<<" "; } ent;

#define coutal(a, n) rep(i, n) { cout<<a[i]<<" "; } ent;

#define ent cout<<endl;



void solve()

{

	ll a, b;

	cin>>a>>b;

	if(a == b)

		cout<<"Yes\n";

	else

		cout<<"No\n";

}

int main()

{

	fastio();

	// citc(tc);

	solve();

}

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



int main (){

	int num1, num2;

	scanf("%d %d", &num1, &num2);

	

	if (num1 == num2){

		printf("Yes \n", num1);

	}

	else {

		printf("No \n", num1);

	}



	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.299042695110809x):
#include <stdio.h>



int main (){

	int num1, num2;

	scanf("%d %d", &num1, &num2);

	

	if (num1 == num2){

		printf("Yes \n", num1);

	}

	else {

		printf("No \n", num1);

	}



	return 0;

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

using namespace std;

int main()

{

    int m,n;

    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.31284588846753x):
#include <stdio.h>



int main (){

	int num1, num2;

	scanf("%d %d", &num1, &num2);

	

	if (num1 == num2){

		printf("Yes \n", num1);

	}

	else {

		printf("No \n", num1);

	}



	return 0;

}