#define _CRT_SECURE_NO_WARNINGS
//#define _GLIBCXX_DEBUG

#include <complex>
#include <iostream>
#include <vector>
#include <cmath>
#include <cstdio>
#include <tuple>
#include <string>
#include <set>

using namespace std;
typedef long long ll;
//#define int ll
//#define endl "\n"
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) loop(i,0,b)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
template<class T> ostream & operator<<(ostream & os, vector<T> const &);
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple<T...> const & t){ os << (n==0?"":" ") << get<n>(t); _ot<n+1>(os, t); }
template<class...T> ostream & operator<<(ostream & os, tuple<T...> const & t){ _ot<0>(os, t); return os; }
template<class T, class U> ostream & operator<<(ostream & os, pair<T,U> const & p){ return os << "(" << p.first << ", " << p.second << ") "; }
template<class T> ostream & operator<<(ostream & os, vector<T> const & v){ rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os; }
template<class T> inline bool chmax(T & x, T const & y){ return x<y ? x=y,true : false; }
template<class T> inline bool chmin(T & x, T const & y){ return x>y ? x=y,true : false; }
#ifdef DEBUG
#define dump(...) (cerr<<#__VA_ARGS__<<" = "<<mt(__VA_ARGS__)<<" ["<<__LINE__<<"]"<<endl)
#else
#define dump(...)
#endif
// ll const mod = 1000000007;
// ll const inf = 1LL<<60;

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

int solve(int x, int y, int rem){
    if(x==0 || y==0) return true;
    if(rem == 0) return false;
    rep(i,8) if(solve(x+dx[i],y+dy[i],rem-1)) return true;
    return false;
}

typedef complex<int> Point;
namespace std {
    bool operator < (const Point & a, const Point & b){
        return make_pair(a.real(),a.imag()) < make_pair(b.real(),b.imag());
    }
}

int solve2(int x, int y){
    set<complex<int>> dp = { Point(0,0) };
    Point dist(x,y);
    if(x == 0 && y == 0) return true;
    rep(i,3){
        auto dp2 = dp;
        for(auto & p : dp){
            rep(d,8) dp2.insert(p+Point(dx[d],dy[d]));
        }
        if(dp2.count(dist)) return true;
        dp.insert(all(dp2));
    }
    // for(auto & p : dp){
    //     cout << p.real() << " " << p.imag() << endl;
    // }
    return false;
}

signed main(){
    int x,y;
    while(cin >> x >> y){
        puts(solve2(x,y) ? "YES" : "NO");
        //break;
    }
}