#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;

inline bool cheak(ll x, ll y, ll xMax, ll yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline ll toInt(string s) { ll v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }

#define For(i,a,b)	for(ll (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define rFor(i,a,b)	for(ll (i) = (a-1);i >= (b);(i)--)
#define rrep(i,n)	rFor(i,n,0)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define sz(a)		(sizeof(a))

#define x first
#define y second

const ll dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };

const ll mod = 1e9 + 7;
const ll INF = 1e9 + 9;

const ll bx[8] = { -2, -2, -1, -1, 1, 1, 2, 2 }, by[8] = { -1, 1, -2, 2, -2, 2, -1, 1 };

int main(){

	int gx, gy;
	cin >> gx >> gy;
	queue<T> q;
	q.push(T(0, 0, 0));
	while (q.size()){
		int x = get<0>(q.front()),y = get<1>(q.front());
		int c = get<2>(q.front());
		q.pop();
		if (x == gx && y == gy){
			cout << "YES" << endl;
			return 0;
		}
		if (c == 3)continue;
		rep(i, 8){
			int tx = x + bx[i], ty = y + by[i];
			q.push(T(tx, ty, c+1));
		}
	}
	cout << "NO" << endl;
	return 0;

	return 0;
}