#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,n,0)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int x, y;

bool dfs(int a, int b, int d) {
    int i;
    int next[8] = {-2,-1,2,1,2,-1,-2,1};
    bool ret = false;
    if (d > 3)
        return false;
    else if (a == x && b == y)
        return true;
    else {
        rep (i,8) ret |= dfs(a+next[i],b+next[(i+1)%8],d+1);
        return ret;
    }
}

int main() {
    cin >> x >> y;
    if (dfs(0,0,0))
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
    return 0;
}