#include<iostream>
#include<cstdio>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<fstream>
#include<iomanip>
#include<ctime>
#include<complex>
#include<functional>
#include<climits>
#include<cassert>
#include<iterator>
#include<unordered_map>
using namespace std;

int dx[] = { 2, -2, -1, -1, 1, 1, 2, 2 };
int dy[] = { -1, 1, -2, 2, -2, 2, -1, 1 };
set<pair<long long int, long long int> > s;
inline void dfs(long long int x, long long int y, int cnt){
	s.insert(make_pair(x, y));
	if (cnt == 3){
		return;
	}
	for (int i = 0; i < 8; i++){
		dfs(x + dx[i], y + dy[i], cnt + 1);
	}
}
int main(){
	long long int x, y;
	scanf("%lld%lld", &x, &y);
	dfs(0, 0, 0);
	if (s.count(make_pair(x, y))){
		puts("YES");
	}
	else{
		puts("NO");
	}
	return 0;
}