#include <bits/stdc++.h>
using namespace std;
const long long MOD = (long long)(1e9) + 7;

long long modpow(long long x , long long p) {
  long long ret = 1;
  while (p) {
    if (p % 2) {
      ret *= x;
      ret %= MOD;
    }
    x *= x;
    x %= MOD;
    p /= 2;
  }
  return ret;
}

int main() {
  long long a , b;
  cin >> a >> b;
  long long ans1 = modpow(a , b);
  long long ans2 = modpow(b , a);
  if (ans1 == ans2) cout << "Yes" << endl;
  else cout << "No" << endl;
  return 0;
}