#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
#include <map>
#include <bitset>
#include <queue>
using namespace std;

//#define __int64 long long
//#define long __int64
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vecy[8] = {-1,1,-2,2,-2,2,-1,1};
const int Vecx[8] = {-2,-2,-1,-1,1,1,2,2};

int main(){
	int field[21][21];
	int x,y;
	int cx,cy;
	int nx,ny;
	queue< pair<int,int> > next;
	cin >> x >> y;
	
	rep(iy,21){
		rep(ix,21){
			field[iy][ix] = -1;
		}
	}
	
	if(abs(x) > 10 || abs(y) > 10){
		cout << "NO" << endl;
		return 0;
	}
	
	next.push(make_pair(10,10));
	field[10][10] = 0;
	
	while(!next.empty()){
		cx = next.front().first;
		cy = next.front().second;
		next.pop();
		
		if(field[cx][cy] <= 2){
			rep(i,8){
				nx = cx + Vecx[i];
				ny = cy + Vecy[i];
				if(field[nx][ny] == -1){
					next.push(make_pair(nx, ny));
					field[nx][ny] = field[cx][cy] + 1;
				}
			}
		}
	}
	
	/*
	rep(iy,21){
		rep(ix,21){
			cout << (field[iy][ix] == -1 ? "□" : "■");
		}
		cout << endl;
	}
	*/
	
	if(field[x + 10][y + 10] != -1){
		cout << "YES" << endl;
	}else{
		cout << "NO" << endl;
	}
	
    return 0;
}