#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    const ll d[8][2] = {{-2, -1}, {-2, 1}, {-1, -2}, {-1, 2}, {1, -2}, {1, 2}, {2, -1}, {2, 1}};
    ll x, y;
    cin >> x >> y;
    if ((x == 0) && (y == 0)) {
        cout << "YES" << endl;
        return 0;
    }
    if ((abs(x) + abs(y)) > 9) {
        cout << "NO" << endl;
        return 0;
    }
    map<ll, map<ll, ll>> dist;
    queue<pair<ll, ll>> q;
    q.push(make_pair(0, 0));
    dist[0][0] = 0;
    while(!q.empty()) {
        auto p = q.front(); q.pop();
        ll cx = p.first, cy = p.second;
        rep(i, 8) {
            ll nx = cx + d[i][0];
            ll ny = cy + d[i][1];
            if ((dist[nx][ny] != 0) && (dist[nx][ny] <= (dist[cx][cy] + 1))) continue;
            if ((dist[cx][cy] + 1) > 3) continue;
            dist[nx][ny] = dist[cx][cy] + 1;
            q.push(make_pair(nx, ny));
        }
    }
    cout << ((dist[x][y] != 0) ? "YES" : "NO") << endl;
    return 0;
}