#include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <array>
#include <tuple>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <list>
#include <cstdio>
#include <limits.h>
#include <string.h>

using namespace std;
using ull = unsigned long long;
using ll = long long;
using lli = long long int;
using ld = long double;
using pa = pair<int,int>;
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define GRESORT(v) sort(v.begin(),v.end(),greater<int>())
#define REVERSE(v) reverse(v.begin(),v.end())
#define overlap(v) v.erase(unique(v.begin(),v.end()),v.end())
#define debug(x) cout << #x << ": " << x << endl
#define INF 999999999

//4近傍
//int dy[]={0, 0, 1, -1};
//int dx[]={1, -1, 0, 0};

//チェス
int dx[]={-2, -2, -1, -1, 1, 1, 2, 2};
int dy[]={-1, 1, -2, 2, -2, 2, -1, 1};

int x,y;

void input(){
    cin >> x >> y;
    x += 20; y += 20;
}

string bfs(){
    if(x > 80 || y > 80 || x < 0 || y < 0) return "NO";
    lli d[80][80];
    for(int i = 0; i < 80; i++){
        for(int j = 0; j < 80; j++){
            d[i][j] = INF;
        }
    }
    d[20][20] = 0;
    queue<pa> que;
    que.push(pa(20,20));
    while(!que.empty()){
        pa p = que.front();
        que.pop();
        int xx = p.first, yy = p.second;
        if(xx >= 40 && yy >= 40) break;
        if(xx == x && yy == y) break;
        for(int i = 0; i < 8; i++) {
            int mx = xx + dx[i];
            int my = yy + dy[i];
            if (d[mx][my] == INF){
                que.push(pa(mx, my));
                d[mx][my] = d[xx][yy] + 1;
            }
        }
    }

    return (d[x][y] < 4 ? "YES" : "NO");
}

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

    input();
    cout << bfs() << endl;

    return 0;
}