#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int)N;i++)
#define p(s) cout<<(s)<<endl
#define ck(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9;

int dx[]={-2,-2,-1,-1,1,1,2,2};
int dy[]={-1,1,-2,2,-2,2,-1,1};

int main(){
	int gx,gy;
	cin>>gx>>gy;
	queue<pair<int,int>> q;
	q.push({0,0});
	string ans="NO";
	while(!q.empty()){
		int x=q.front().F,y=q.front().S;
		q.pop();
		if(x==gx && y==gy) ans="YES";
		if(x==6 && y==3) break;
		REP(i,0,8) q.push({x+dx[i],y+dy[i]});
	}
	p(ans);
	return 0;
}