#include <iostream>
#include <vector>
using namespace std;
typedef long long LL;
int X,Y;
LL dist(int x1,int y1,int x2,int y2){
	return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
}
bool canGoTo(int x,int y,int &num)
{
	if (x==X && y==Y){
		cout<<"YES"<<endl;
		return true;
	}
	vector<pair<int,int>> myVec;
	myVec.push_back(make_pair(x-2,y-1));
	myVec.push_back(make_pair(x-2,y+1));
	myVec.push_back(make_pair(x-1,y-2));
	myVec.push_back(make_pair(x-1,y+2));
	myVec.push_back(make_pair(x+1,y-2));
	myVec.push_back(make_pair(x+1,y+2));
	myVec.push_back(make_pair(x+2,y-1));
	myVec.push_back(make_pair(x+2,y+1));
	int i;
	for (i=0;i<myVec.size();i++){
		if (myVec[i].first==X && myVec[i].second==Y){
			myVec.clear();
			cout<<"YES"<<endl;
			return true;
		}
	}
	num++;
	if (num==3){
		cout<<"NO"<<endl;
		return false;
	}
	int xMin,yMin;
	LL distMin=1e18;
	LL distXY;
	for (i=0;i<myVec.size();i++){
		distXY=dist(X,Y,myVec[i].first,myVec[i].second);
		if (distMin>distXY){
			distMin=distXY;
			xMin=myVec[i].first;
			yMin=myVec[i].second;
		}
	}
	myVec.clear();
	return canGoTo(xMin,yMin,num);
}
int main(int argc, char* argv[])
{

	cin>>X>>Y;
	int num=1;
	canGoTo(0,0,num);
	return 0;
}