#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define db(a, b) cout << #a << ": " << a << " " << #b << ": " << b << endl;

//{上,右,下,左}
const int dx[] = {-2, -2, -1, -1, +1, +1, +2, +2},
          dy[] = {-1, +1, -2, +2, -2, +2, -1, +1};

int main() {
  int gx, gy;
  cin >> gx >> gy;

  set<P> s;
  s.emplace(0, 0);
  queue<T> q;
  q.emplace(0, 0, 0);
  while (sz(q)) {
    auto [x, y, d] = q.front();
    q.pop();
    if (d >= 3) continue;
    rep(i, 8) {
      int nx = dx[i] + x, ny = dy[i] + y;
      if (s.count(P(nx, ny))) continue;
      s.emplace(nx, ny);
      q.emplace(nx, ny, d + 1);
    }
  }
  if (s.count(P(gx, gy)))
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}