#include <bits/stdc++.h>

typedef long long LL;

#define rep(i, n)     for (LL i = 0; i < n; ++i)
#define rep1(i, n)    for (int i = 1; i <= n; ++i)
#define repB(i, m, n) for (LL i = m; i <= n; ++i)
#define repR(i, n)    for (LL i = n - 1; i >= 0; --i)
#define all(n)        n.begin(), n.end()

using namespace std;

int main() {
	ios::sync_with_stdio(0);
	int x, y;
	cin >> x >> y;
	
	if (abs(x - y) < 3) {
		cout << "Yes";
	} else {
		cout << "No";
	}
	
	return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<LL,int> LP;
const int INF=1<<30;
const LL MAX=1e9+7;

void array_show(int *array,int array_n,char middle=' '){
    for(int i=0;i<array_n;i++)printf("%d%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(LL *array,int array_n,char middle=' '){
    for(int i=0;i<array_n;i++)printf("%lld%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){
    if(vec_n==-1)vec_n=vec_s.size();
    for(int i=0;i<vec_n;i++)printf("%d%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}
void array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){
    if(vec_n==-1)vec_n=vec_s.size();
    for(int i=0;i<vec_n;i++)printf("%lld%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}

int main(){
    LL n,m;
    int i,j,k;
    LL a,b,c;
    int s=0;
    cin>>n>>m;
    for(a=1;a<=1e6+7;a++){
        if(m%a)continue;
        b=m/a;
        if(b<a)break;
        if(a+b==n)s++;
    }
    if(s)cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
}