#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;

int main(){
    int x, y;
    cin >> x >> y;
    set<vector<int>> st;
    deque<vector<int>> dq;
    dq.push_back({0, 0, 0});
    st.insert({0, 0});
    vector<int> dx{2, 2, 1, -1, -2, -2, -1, 1}, dy{1, -1, -2, -2, -1, 1, 2, 2};
    while (!dq.empty()){
        int tx, ty, tt, nx, ny;
        vector<int> vt = dq.front();
        tx = vt[0], ty = vt[1], tt = vt[2];
        dq.pop_front();

        if (tt == 3) continue;
        tt++;
        for (int i = 0; i < 8; i++){
            nx = tx + dx[i];
            ny = ty + dy[i];
            st.insert({nx, ny});
            dq.push_back({nx, ny, tt});
        }
    }
    for (auto tmp : st){
        if (tmp.front() == x && tmp.back() == y) {
            cout << "YES" << endl;
            return 0;
        }
    }
    cout << "NO" << endl;
}