#include #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) for(int i=0;i<(n);++i) #define FORq(i, m, n) for(int i = (m);i <= (n);++i) #define SCD(n) scanf("%d",&n) #define SCD2(m,n) scanf("%d%d",&m,&n) #define SCD3(m,n,k) scanf("%d%d%d",&m,&n,&k) #define PB push_back #define MP make_pair #define ARSCD(A,N) REP(i,N){SCD(A[i]);} #define ARSCD1(A,N) FORq(i,1,N){SCD(A[i]);} #define PRINTD(n) printf("%d\n",n) #define PRINTLLD(n) printf("%lld\n",n) #define DEBUG printf("%s\n","debug") #define fst first #define snd second #define IN(x,S) (S.count(x) != 0) using namespace std; typedef pair PII; typedef vector VI; typedef long long ll; ////////////////////////////////////////////////////// int main(){ int X,Y; SCD2(X,Y); vectorQ; Q.PB(MP(-2,-1)); Q.PB(MP(-2,1)); Q.PB(MP(-1,-2)); Q.PB(MP(-1,2)); Q.PB(MP(1,-2)); Q.PB(MP(1,2)); Q.PB(MP(2,-1)); Q.PB(MP(2,1)); REP(i,8){ PII xy = Q[i]; int x = xy.fst; int y = xy.snd; Q.PB(MP(x-2,y-1)); Q.PB(MP(x-2,y+1)); Q.PB(MP(x-1,y-2)); Q.PB(MP(x-1,y+2)); Q.PB(MP(x+1,y-2)); Q.PB(MP(x+1,y+2)); Q.PB(MP(x+2,y-1)); Q.PB(MP(x+2,y+1)); } REP(i,64){ PII xy = Q[i+8]; int x = xy.fst; int y = xy.snd; Q.PB(MP(x-2,y-1)); Q.PB(MP(x-2,y+1)); Q.PB(MP(x-1,y-2)); Q.PB(MP(x-1,y+2)); Q.PB(MP(x+1,y-2)); Q.PB(MP(x+1,y+2)); Q.PB(MP(x+2,y-1)); Q.PB(MP(x+2,y+1)); } REP(i,512){ PII xy = Q[i]; int x = xy.fst; int y = xy.snd; if ((x==X) and (y==Y)){ printf("YES\n"); return 0; } } printf("NO\n"); return 0; }