#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int orientation(pair<int, int> &p, pair<int, int> &q, pair<int, int> &r) {
  int val = (q.second - p.second) * (r.first - q.first) -
            (q.first - p.first) * (r.second - q.second);
  if (val == 0) return 0;
  return (val > 0) ? 1 : 2;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int R, B;
  cin >> R >> B;
  if (R != B) {
    cout << "No\n";
    return 0;
  }
  vector<pair<int, int> > vr(R);
  vector<pair<int, int> > vb(B);
  for (int i = 0; i < R; i++) cin >> vr[i].first >> vr[i].second;
  for (int i = 0; i < B; i++) cin >> vb[i].first >> vb[i].second;
  vector<int> p(R);
  for (int i = 0; i < R; i++) p[i] = i;
  bool flag = true;
  do {
    for (int i = 0; i < R - 1; i++) {
      for (int j = i + 1; j < R; j++) {
        int o1 = orientation(vr[p[i]], vb[p[i]], vr[p[j]]);
        int o2 = orientation(vr[p[i]], vb[p[i]], vb[p[j]]);
        int o3 = orientation(vr[p[j]], vb[p[j]], vr[p[i]]);
        int o4 = orientation(vr[p[j]], vb[p[j]], vb[p[i]]);
        if (o1 != o2 && o3 != o4)
          continue;
        else {
          flag = false;
          break;
        }
      }
    }
  } while (next_permutation(p.begin(), p.end()));
  if (!flag || R == 1) {
    printf("Yes");
  } else
    cout << "No";
  return 0;
}
