#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100005;
struct Fly {
  int x, y;
} F[MAX_N];
struct Land {
  int a, b;
} L[MAX_N];
int main() {
  int R, B;
  cin >> R >> B;
  for (int i = 0; i < R; i++) {
    cin >> F[i].x >> F[i].y;
  }
  for (int j = 0; j < B; j++) {
    cin >> L[j].a >> L[j].b;
  }
  if (R == B) {
    cout << "Yes" << endl;
    return 0;
  } else {
    cout << "No" << endl;
    return 0;
  }
}
