#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define REP(i, n) for(int(i)=0;(i)<(n);++(i))
#define in(T,V) T V;cin>>V;
const int MOD = int(1e9+7);

const int dir[][2] = {{-2,-1},{-2,1},{-1,-2},{-1,2},{1,-2},{1,2},{2,-1},{2,1}};

int m[30][30];
int &mm(int x, int y){ return m[y+15][x+15]; }

int main(){
    in(int, X);
    in(int, Y);
    REP(y,30)REP(x,30)m[y][x] = 10;

    deque<pair<int,int> > q;
    mm(0,0) = 0;
    q.push_back(make_pair(0,0));
    while(!q.empty()){
        int x = q.front().first;
        int y = q.front().second;
        q.pop_front();
        if(mm(x,y) >= 3) continue;
        REP(d,8){
            int mx = x + dir[d][0];
            int my = y + dir[d][1];
            if(mm(mx,my) > mm(x,y)+1){
                mm(mx,my) = mm(x,y)+1;
                q.push_back(make_pair(mx,my));
            }
        }
    }
    bool res = false;
    if(abs(X) < 10 && abs(Y) < 10 && mm(X,Y) <= 3) res = true;

    cout << (res ? "YES" : "NO") << endl;
}