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

#define int long long
#define rep(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
template<class T>bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,T b){if(a>b){a=b;return 1;}return 0;}

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

const int inf = 1LL<<60;
const int mod = 1e9 + 7;
const double eps = 1e-9;

/*{
}*/

int gx, gy;

bool dfs(int x, int y, int t)
{
  if(x == gx and y == gy){
    return true;
  }

  int dx[] = {-2,-2,-1,-1,1,1,2,2};
  int dy[] = {-1,1,-2,2,-2,2,-1,1};

  if(t < 3){
    rep(i, 0, 8){
      if(dfs(x+dx[i], y+dy[i], t+1)) return true;
    }
  }

  return false;
}

signed main()
{
  cin >> gx >> gy;

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

  return 0;
}