#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

#define FORR(i,b,e) for(int i=(b);i<(int)(e);++i)
#define FOR(i,e) FORR(i,0,e)
#define sortuniq(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(),v.end()),v.end())
#define dump(var) cerr << #var ": " << var << "\n"
#define dumpc(con) for(auto& e: con) cerr << e << " "; cerr<<"\n"

typedef long long ll;
typedef unsigned long long ull;

const double EPS = 1e-6;
const int d4[] = {0, -1, 0, 1, 0};

using namespace std;

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

vector<vector<bool>> p(20, vector<bool>(20, false));

void check(int x, int y, int n) {
    p[10+y][10+x] = true;
    if (n > 0) {
        FOR(i, 8) {
            check(x+dx[i], y+dy[i], n-1);
        }
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

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

    check(0, 0, 3);

    if (X < -6 || 6 < X || Y < -6 || 6 < Y) {
        cout << "NO" << endl;
    }
    else {
        cout << (p[10+Y][10+X]? "YES": "NO") << endl;
    }

    
    return 0;
}