#include<bits/stdc++.h>
using namespace std;
using ll =long long;
#define rep(i,N) for(int (i)=0;(i)<(N);++(i))
#define SORT(i) sort((i).begin(),(i).end())
constexpr int INF = 2000000000;
constexpr ll mod = 1000000007;

int main() {
	int gx, gy; cin >> gx >> gy;
	gy = abs(gy), gx = abs(gx);
	vector<vector<int>>dist(gy, vector<int>(gx, -1));
	queue<pair<int, int>>que;
	--gx, --gy;
	dist[0][0] = 0;
	que.push(make_pair(0, 0));
	int ny, nx;
	int y[8] = { -1,1,-2,2,-2,2,-1,1 };
	int x[8] = { -2,-2,-1,-1,1,1,2,2 };

	while (!que.empty()) {
		pair<int, int>N = que.front();
		que.pop();
		rep(i, 8) {
			ny = N.first + y[i], nx = N.second + x[i];
			if (ny < 0 || nx < 0 || ny > gy || nx > gx || dist[ny][nx] != -1)continue;
			else {
				dist[ny][nx] = dist[N.first][N.second] + 1;
				que.push(make_pair(ny, nx));
			}
		}
	}
	if (dist[gy][gx] > 3)cout << "NO" << "\n";
	else cout << "YES" << "\n";

	return 0;
}