#include using namespace std; #define rep(i,n) for(int i = 0; i < (int)n; i++) #define FOR(n) for(int i = 0; i < (int)n; i++) #define repi(i,a,b) for(int i = (int)a; i < (int)b; i++) #define pb push_back #define m0(x) memset(x,0,sizeof(x)) #define fill(x,y) memset(x,y,sizeof(x)) #define bg begin() #define ed end() #define all(x) x.bg,x.ed #define vi vector #define vvi vector #define vll vector #define vvll vector #define vs vector #define vvs vector #define vc vector #define vvc vector #define pii pair #define pllll pair #define vpii vector> #define vpllll vector> #define vpis vector> #define vplls vector> #define vpsi vector> #define vpsll vector> #define int ll using ll = long long; using ld = long double; using ull = unsigned long long; void print_vec(vector &a) { for(int i = 0; i < (int)a.size(); i++) { cout << a[i]; if(i != a.size() - 1) cout << " "; } cout << "\n"; } const ll INF = 1e15; const ld pi = 3.1415926535897932384626433832795028; const ll mod = 1e9 + 7; int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1}; int dy[] = {0, -1, 0, 1, -1, 1, -1, 1}; void solve() { int a, b; cin >> a >> b; if(a == b) cout << "Yes"; else cout << "No"; } signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); solve(); return 0; }