#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
int main(){
    map<pl,ll> mp;
    mp[{0,0}]=0;
    queue<pl> que;que.push({0,0});
    ll dkx[8]={-2,-2,-1,-1,1,1,2,2};
    ll dky[8]={-1,1,-2,2,-2,2,-1,1};
    while(!que.empty()){
        pl p=que.front();que.pop();
        if(mp[p]==3)continue;
        rep(i,8){
            ll nx=p.fi+dkx[i],ny=p.se+dky[i];
            if(mp.count({nx,ny}))continue;
            mp[{nx,ny}]=mp[p]+1;
            que.push({nx,ny});
        }
    }
    ll x,y;cin >> x >> y;
    if(mp.count({x,y}))cout << "YES" <<endl;
    else cout << "NO" <<endl;
}