#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <cmath>

#include <string>
#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>

/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;

#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    cout << setprecision(10);//

	bool w[13][13];
	bool w2[13][13];
	rep(i,13)rep(j,13){
		w[i][j] = false;
		w2[i][j] = false;
	}
	int cen = 6;
	w[cen][cen]=true;
	for(int i=0;i<3;++i){
		rep(i,13)rep(j,13){
			if(w[i][j]== true){
//(x-2,y-1),(x-2,y+1),(x-1,y-2),(x-1,y+2),(x+1,y-2),(x+1,y+2),(x+2,y-1),(x+2,y+1)
w2[i-1][j-2] = true;
w2[i+1][j-2] = true;
w2[i-2][j-1] = true;
w2[i+2][j-1] = true;
w2[i-2][j+1] = true;
w2[i+2][j+1] = true;
w2[i-1][j+2] = true;
w2[i+1][j+2] = true;
			}
		}
		rep(i,13)rep(j,13){
			w[i][j] |= w2[i][j];
		}
	}
	int X,Y;
	cin>>X>>Y;
	if(-6<=X && X <= 6 && -6<=Y && Y<=6){
		if(w[Y+cen][X+cen] == true){
			P("YES");
		}else{
			P("NO");
		}
	}else{
		P("NO");
	}
    return 0;
}