#include <bits/stdc++.h>
using namespace std;
#define INF 100000000 ;
#define rep(i,n) for(int i=0;i< (int)(n);i++)
typedef vector<vector<int>> Vi;
typedef vector<vector<char>> Vc;
typedef pair<int,int> P;
typedef long long ll;

int main(){
  int  M ,H;
  cin >> M >> H;
  if(H%M==0){
    cout << "Yes";
  }else{
    cout << "No";
  }
}

#include <iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<numeric>
#include<functional>
#include <iomanip>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;

#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
#define  DESC std::greater<int>() //sort 3rd arg



int main() {
    int x, y;
    cin >> x >> y;

    if (x > y) {
        swap(x, y);
    }

    if (x + 3 > y) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl;
    }
    

    return 0;
}
