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

#define pll pair<long long,long long>
#define NUM 20

using namespace std;

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

int main(void){
    long long X,Y;
    cin>>X>>Y;
    if(X>10 || Y>10 || X<-10 || Y<-10){
        cout<<"NO"<<endl; return 0;
    }
    X+=NUM; Y+=NUM;
    long long P[X+1][Y+1];
    for(long long i=0;i<=X;i++){
        for(long long j=0;j<=Y;j++) P[i][j]=-1;
    }
    queue<pll> q;
    queue<pll> buf;
    q.push(pll(NUM,NUM));
    while(!q.empty()){
        pll p=q.front(); q.pop();
        int x=p.first,y=p.second;
        for(int i=0;i<8;i++){
            int nx=x+dx[i],ny=y+dy[i];
            if(nx<0 || ny<0 || nx>X || ny>Y) continue;
            if(P[nx][ny]!=-1) continue;
            q.push(pll(nx,ny));
            P[nx][ny]=P[x][y]+1;
            if(P[nx][ny]>5){
                while(!q.empty()) q.pop();
            }
        }
    }
    if(P[X][Y]>-1 && P[X][Y]<=3) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
}