#include <bits/stdc++.h>
using namespace std;
int solve() {
  int n, nr, nb;
  scanf("%d%d", &nr, &nb);
  if (nr != nb) {
    puts("No");
    return 0;
  }
  n = nr;
  vector<pair<long long, long long> > a(n), b(n);
  for (int i = 0; i < n; ++i) scanf("%lld%lld", &a[i].first, &a[i].second);
  for (int i = 0; i < n; ++i) scanf("%lld%lld", &b[i].first, &b[i].second);
  while (n > 0) {
    bool fnd = false;
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; ++j) {
        long long vx = b[j].first - a[i].first, vy = b[j].second - a[i].second;
        bool left = true, right = true;
        for (int k = 0; k < n; ++k) {
          if (k == i) continue;
          long long ux = a[k].first - a[i].first,
                    uy = a[k].second - a[i].second;
          long long mod_sin = ux * vy - uy * vx;
          if (mod_sin > 0) {
            right = false;
          }
          if (mod_sin < 0) {
            left = false;
          }
        }
        if (!left && !right) continue;
        fnd = true;
        a.erase(a.begin() + i);
        b.erase(b.begin() + j);
        break;
      }
      if (fnd) break;
    }
    if (!fnd) break;
    n--;
  }
  if (n > 0)
    puts("No");
  else
    puts("Yes");
}
int main(int arc, char* argv[]) { solve(); }
