#include <bits/stdc++.h>
using namespace std;
template <class T>
T mceil(T a, T b) {
  if (a % b == 0)
    return a / b;
  else
    return a / b + 1;
}
const long long int M = 1e9 + 7;
const long long int N = 2e5 + 5;
const long long int inf = 9e18;
vector<long long int> vis;
vector<vector<long long int> > adj;
void solve() {}
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, m;
  cin >> n >> m;
  set<pair<long long int, long long int> > base, target;
  for (long long int i = 0; i < n; i++) {
    long long int x, y;
    cin >> x >> y;
    base.insert({x, y});
  }
  for (long long int i = 0; i < m; i++) {
    long long int x, y;
    cin >> x >> y;
    target.insert({x, y});
  }
  if (n != m) {
    cout << "No"
         << "\n";
    return 0;
  }
  cout << "Yes";
}
