#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int dx[8] = {-2, -2, -1, -1, 1, 1, 2, 2};
int dy[8] = {-1, 1, -2, 2, -2, 2, -1, 1}; // 移動方向

//入力
ll gx, gy;

bool bfs(ll sx, ll sy)
{
    int count = 0;
    queue<P> que;
    que.push(P(sx, sy));
    while (que.size())
    {
        P p = que.front();
        que.pop();
        if (p.first == gx && p.second == gy)
            return true;
        if (count == 512)
            return false;
        for (int i = 0; i < 8; i++)
        {
            ll nx = p.first + dx[i];
            ll ny = p.second + dy[i];
            que.push(P(nx, ny));
        }
        count++;
    }
    return false;
}

void solve()
{
    if (bfs(0, 0))
        printf("YES\n");
    else
        printf("NO\n");
}

int main()
{
    cin >> gx >> gy;
    solve();
}