#include <bits/stdc++.h>
using namespace std;
int n, m, to[1010], used[1010], fl(0);
struct node {
  int x, y;
} a[1010], b[1010];
template <class Aqua>
inline void read(Aqua &s) {
  s = 0;
  Aqua f = 1;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) s = s * 10 + c - '0', c = getchar();
  s *= f;
}
double calc(int A, int B, int c, int d) {
  double k = (double)(a[A].y - b[B].y) / (a[A].x - b[B].x),
         k_ = (double)(a[c].y - b[d].y) / (a[c].x - b[d].x);
  double b = (double)a[A].y - (double)k * a[A].x,
         b_ = (double)a[c].y - (double)k_ * a[c].x;
  return (double)(b_ - b) / (k - k_);
}
bool check(int x, int t) {
  for (int i = 1; i <= x - 1; i++)
    if (calc(i, to[i], x, t) + 1e-7 > min(a[x].x, b[t].x) &&
        calc(i, to[i], x, t) - 1e-7 < min(a[x].x, b[t].x))
      return 0;
  return 1;
}
void search(int dep) {
  if (fl) return;
  if (dep > n) {
    fl = 1;
    return;
  }
  for (int j = 1; j <= n; j++)
    if (!used[j] && check(dep, j)) {
      to[dep] = j;
      used[j] = 1;
      search(dep + 1);
      used[j] = 0;
    }
}
int main() {
  read(n), read(m);
  for (int i = 1; i <= n; i++) read(a[i].x), read(a[i].y);
  for (int i = 1; i <= m; i++) read(b[i].x), read(b[i].y);
  if (n != m) {
    puts("No");
    return 0;
  }
  search(1);
  if (fl)
    puts("Yes");
  else
    puts("No");
  return 0;
}
