#include<bits/stdc++.h>
using namespace std;
using ll = long long;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("YES")
#define p_no() p("NO")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

int dx[8] = {-2, -2, -1, -1, 1, 1, 2, 2};
int dy[8] = {-1, 1, -2, 2, -2, 2, -1, 1};

ll X, Y;

bool dfs(ll x, ll y, ll count){
    if(x==X && y==Y) return true;
    if(count==0) return false;

    FOR(i, 0, 8){
        ll nx = x + dx[i];
        ll ny = y + dy[i];

        if(dfs(nx, ny, count-1)){
            return true;
        }
    }
    return false;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    cin >> X >> Y;

    bool can_reach = dfs(0, 0, 3);

    if(can_reach){
        p_yes();
    }else{
        p_no();
    }
    
    return 0;
}