#include <bits/stdc++.h>
using namespace std;

int x,y;
int dx[] = {-2,-2,-1,-1,1,1,2,2};
int dy[] = {-1,1,-2,2,-2,2,-1,1};
bool flag = false;

int dfs(int nx,int ny,int n)
{
    if(n > 3) return 0;
    if(nx == x && ny == y) flag = true;
    else{
        for(int i = 0; i < 8; i++){
            dfs(nx+dx[i],ny+dy[i],n+1);
        }
    }
    return flag;
}

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

    cout << (dfs(0,0,0) ? "YES" : "NO") << endl;

    return 0;
}