#include <bits/stdc++.h>
using namespace std;
long long YES, R, B, RB[12], BR[12];
pair<long long, long long> R_pair[12], B_pair[12];
void Equation(long long &a, long long &b, long long &c, long long i,
              long long j) {
  long long dy, dx, x1, y1;
  y1 = R_pair[i].second, x1 = R_pair[i].first;
  dy = R_pair[i].second - B_pair[j].second;
  dx = R_pair[i].first - B_pair[j].first;
  a = dy, b = -dx, c = y1 * dx - x1 * dy;
}
bool Valid(long long idx, long long a, long long b) {
  long long a1, b1, c1, a2, b2, c2, down, x1, y1, x, y, x2, y2, test1, test2;
  Equation(a1, b1, c1, a, b);
  for (long long i = 1; i < idx; ++i) {
    Equation(a2, b2, c2, i, RB[i]);
    down = a1 * b2 - a2 * b1;
    x = b1 * c2 - b2 * c1;
    y = c1 * a2 - c2 * a1;
    test1 = test2 = 0;
    x2 = B_pair[b].first;
    y2 = B_pair[b].second;
    x1 = R_pair[a].first;
    y1 = R_pair[a].second;
    if (((x >= x1 * down && x <= x2 * down) ||
         (x >= x2 * down && x <= x1 * down)) &&
        ((y >= y1 * down && y <= y2 * down) ||
         (y >= y2 * down && y <= y1 * down)))
      return test1 = 1;
    x2 = R_pair[i].first;
    y2 = R_pair[i].second;
    x1 = B_pair[RB[i]].first;
    y1 = B_pair[RB[i]].second;
    if (((x >= x1 * down && x <= x2 * down) ||
         (x >= x2 * down && x <= x1 * down)) &&
        ((y >= y1 * down && y <= y2 * down) ||
         (y >= y2 * down && y <= y1 * down)))
      return test2 = 1;
    if (test1 && test2) return false;
  }
  return true;
}
void dfs(long long idx = 1) {
  if (idx == R + 1) {
    YES = 1;
    return;
  }
  for (long long i = 1; i <= B; ++i)
    if (BR[i] == 0) {
      if (Valid(idx, idx, i)) {
        BR[i] = idx;
        RB[idx] = i;
        dfs(idx + 1);
        if (YES) return;
        BR[i] = RB[idx] = 0;
      }
    }
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> R >> B;
  if (R != B) {
    cout << "No\n";
    return 0;
  }
  for (long long i = 1; i <= R; ++i) cin >> R_pair[i].first >> R_pair[i].second;
  for (long long i = 1; i <= B; ++i) cin >> B_pair[i].first >> B_pair[i].second;
  dfs();
  if (YES)
    cout << "Yes\n";
  else
    cout << "No\n";
  return 0;
}
