#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF (1LL<<25)     //33554432
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

int dx[] = {-2, -2, -1, -1, 1, 1, 2, 2}, dy[] = {-1, 1, -2, 2, -2, 2, -1, 1};
signed main(void)
{
  ll x, y;
  cin >> x >> y;

  int d[31][31];
  REP(i, 31) REP(j, 31) d[i][j] = INF;
  queue<VI> que;
  que.push({0, 0, 0});
  d[0][0] = 0;

  while(que.size()) {
    VI p = que.front(); que.pop();
    if(p[2] == 3) continue;
    REP(i, 8) {
      int nx = p[0]+dx[i], ny = p[1]+dy[i];
      if(d[ny+15][nx+15] == INF) {
        que.push({ny, nx, p[2]+1});
        d[ny+15][nx+15] = p[2];
      }
    }
  }
  if(abs(x)<=15 && abs(y)<=15 && d[y+15][x+15] != INF) cout << "YES" << endl;
  else cout << "NO" << endl;

  return 0;
}