#include <bits/stdc++.h>
using namespace std;
const int N = (int)(2e5 + 5);
int R, B;
pair<long long, long long> r[15], b[15];
int id[15];
bool intersect(pair<long long, long long> &p1, pair<long long, long long> &p2,
               pair<long long, long long> &q1, pair<long long, long long> &q2) {
  return (((q1.first - p1.first) * (p2.second - p1.second) -
           (q1.second - p1.second) * (p2.first - p1.first)) *
              ((q2.first - p1.first) * (p2.second - p1.second) -
               (q2.second - p1.second) * (p2.first - p1.first)) <
          0) &&
         (((p1.first - q1.first) * (q2.second - q1.second) -
           (p1.second - q1.second) * (q2.first - q1.first)) *
              ((p2.first - q1.first) * (q2.second - q1.second) -
               (p2.second - q1.second) * (q2.first - q1.first)) <
          0);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie();
  cin >> R >> B;
  if (R != B) {
    cout << "No" << endl;
    return 0;
  }
  for (int i = 0; i < R; i++) cin >> r[i].first >> r[i].second;
  for (int i = 0; i < B; i++) cin >> b[i].first >> b[i].second;
  for (int i = 0; i < R; i++) id[i] = i;
  do {
    bool ok = true;
    for (int i = 0; i < R; i++) {
      for (int j = i + 1; j <= R; j++) {
        if (intersect(r[i], b[id[i]], r[j], b[id[j]])) {
          ok = false;
          break;
        }
      }
      if (!ok) break;
    }
    if (ok) {
      cout << "Yes" << endl;
      return 0;
    }
  } while (next_permutation(id, id + R));
  return 0;
}
