#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > vii, vii2;
struct Point {
  int x, y;
  Point(int xx, int yy) {
    x = xx;
    y = yy;
  }
};
bool onSegment(Point &p, Point &q, Point &r) {
  if (q.x <= max(p.x, r.x) && q.x >= min(p.x, r.x) && q.y <= max(p.y, r.y) &&
      q.y >= min(p.y, r.y))
    return true;
  return false;
}
int orientation(Point p, Point q, Point r) {
  int val = (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
  if (val == 0) return 0;
  return (val > 0) ? 1 : 2;
}
bool doIntersect(Point p1, Point q1, Point p2, Point q2) {
  int o1 = orientation(p1, q1, p2);
  int o2 = orientation(p1, q1, q2);
  int o3 = orientation(p2, q2, p1);
  int o4 = orientation(p2, q2, q1);
  if (o1 != o2 && o3 != o4) return true;
  if (o1 == 0 && onSegment(p1, p2, q1)) return true;
  if (o2 == 0 && onSegment(p1, q2, q1)) return true;
  if (o3 == 0 && onSegment(p2, p1, q2)) return true;
  if (o4 == 0 && onSegment(p2, q1, q2)) return true;
  return false;
}
bool intersect(int v) {
  for (int i = 0; i < vii.size(); ++i) {
    if (i == v) continue;
    Point p1(vii[v].first, vii[v].second);
    Point q1(vii2[v].first, vii2[v].second);
    Point p2(vii[i].first, vii[i].second);
    Point q2(vii2[i].first, vii2[i].second);
    if (doIntersect(p1, q1, p2, q2) == true) return true;
  }
  return false;
}
int main() {
  int n, b;
  cin >> n >> b;
  if (n != b)
    cout << "No" << endl;
  else
    cout << "Yes" << endl;
}
