#include<iostream>
#include<vector>
#include<queue>

using namespace std;

typedef pair<int,int> P;
typedef long long ll;

static const ll MAX=1000000000;

void bfs(int x,int y){
    queue<P> que;
    que.push(P(0,0));
    queue<int> num;
    num.push(0);
    int cnt=0;
    while(!que.empty()){
        P p=que.front(); que.pop();
        int cnt=num.front(); num.pop();
        if(cnt>=3) continue;
        ll dx[8],dy[8];
        dx[0]=p.first+1; dy[0]=p.second+2;
        dx[1]=p.first+2; dy[1]=p.second+1;
        dx[2]=p.first+1; dy[2]=p.second-2;
        dx[3]=p.first+2; dy[3]=p.second-1;
        dx[4]=p.first-1; dy[4]=p.second+2;
        dx[5]=p.first-1; dy[5]=p.second-2;
        dx[6]=p.first-2; dy[6]=p.second+1;
        dx[7]=p.first-2; dy[7]=p.second-1;
        for(int i=0;i<8;i++){
            if(dx[i]==x&&dy[i]==y){
                cout << "YES" << endl;
                return;
            }
            que.push(P(dx[i],dy[i]));
            num.push(cnt+1);
        }
    }
    cout << "NO" << endl;
}

int main(){
    int X,Y;
    cin >> X >> Y;
    bfs(X,Y);
}