#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

typedef pair<int, int> P;
int dy[] = {-2, -2, -1, -1, 1, 1, 2, 2, 0};
int dx[] = {-1, 1, -2, 2, -2, 2, -1, 1, 0};

int main() {
    set<P> good;

    rep (i, 9) {
        rep (j, 9) {
            rep (k, 9) {
                int y = dy[i] + dy[j] + dy[k];
                int x = dx[i] + dx[j] + dx[k];

                good.insert(P(y, x));
            }
        }
    }

    int Y, X;
    cin >> Y >> X;

    if (good.count(P(Y, X))) {
        cout << "YES" << endl;
    } else {
        cout << "NO" << endl;
    }

    return 0;
}