#include <iostream>
#include <queue>
using namespace std;

int main() {
    
    int X, Y;
    
    cin>>X>>Y;
    
    int grid[20][20] = {0};
    grid[0][0] = 1;
    
    int dx[8] = {-1,1,2,2,1,-1,-2,-2};
    int dy[8] = {2,2,1,-1,-2,-2,-1,1};
    
    int nowx=0, nowy=0, n=0;

    queue<int> queuex;
    queue<int> queuey;
    
    while(1){
        
        if(grid[Y][X] == 1){
            cout<<"YES"<<endl;
            return 0;
        }
        if(n == 3){
            cout<<"NO"<<endl;
            return 0;
        }
        
        nowx = queuex.front();
        nowy = queuey.front();
        queuex.pop(); queuey.pop();
        for(int i=0 ; i<8 ; i++){
            int nextx = nowx + dx[i];
            int nexty = nowy + dy[i];
            grid[nexty][nextx] = 1;
            queuex.push(nextx);
            queuey.push(nexty);
        }
        n++;
        
    }
    
    
    return 0;
}