#include<iostream>
#include<math.h>
#include<vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) //printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

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

pos p[512];

/*================================*/

signed main()
{
    int x, y;
    cin >> x >> y;

    bool can = false;
    REP(i, 8) {
        int x1 = dx[i];
        int y1 = dy[i];
        if (x == x1 && y == y1) can = true;
        REP(j, 8) {
            int x2 = dx[j] + x1;
            int y2 = dy[j] + y1;
            if (x == x2 && y == y2) can = true;
            REP(k, 8) {
                int x3 = dx[k] + x2;
                int y3 = dy[k] + y2;
                if (x == x3 && y == y3) can = true;
            }
        }
    }

    cout << (can ? "YES" : "NO") << endl;

    return 0;
}