#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
 
using namespace std;
 
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define pb push_back
 
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef pair<long,long> pll;
typedef long long ll;

int main(){
	int x,y;
	//cnt=0; //これじゃ駄目だなぁ；；
	cin>>x>>y;
	queue<pair<int,int>> q;
	queue<int>cnt;
	q.push(make_pair(0,0));
	cnt.push(0);
	while(!q.empty()){
		pair<int,int>tmp=q.front();
		q.pop();
		int tmp_2=cnt.front();
		cnt.pop();
		if(tmp_2>=3)
			continue;
		
		int mx[8]={-1,-2,-2,-1,1,2,2,1};
		int my[8]={2,1,-1,-2,-2,-1,1,2};
		for(int i=0;i<8;i++){
			int next_x=tmp.first+mx[i];
			int next_y=tmp.second+my[i];
			if(next_x==x&&next_y==y){
				cout<<"YES"<<endl;
				return 0;
			}
			q.push(make_pair(next_x,next_y));
			cnt.push(tmp_2+1);
			}
	//		cnt++;
	}
	cout<<"NO"<<endl;
	return 0;
}