#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;

#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 dfs(ll sx, ll sy, int count)
{
    if (sx == gx && sy == gy)
        return true;
    if (count >= 3)
        return false;
    for (int i = 0; i < 8; i++)
    {
        //printf("%lld %lld\n", sx + dx[i], sy + dy[i]);
        if (dfs(sx + dx[i], sy + dy[i], count + 1))
            return true;
    }
    return false;
}

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

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