#include <iostream>
#include <vector>
#include <queue>
#include <tuple>

const std::vector<int>
    dx{-2, -2, -1, -1, 1, 1, 2, 2},
    dy{-1, 1, -2, 2, -2, 2, -1, 1};

void solve() {
    int gx, gy;
    std::cin >> gx >> gy;

    std::queue<std::pair<int, int>> que, nque;
    que.emplace(0, 0);

    for (int d = 0; d < 3; ++d) {
        while (!que.empty()) {
            int x, y;
            std::tie(x, y) = que.front();
            que.pop();

            for (int i = 0; i < 8; ++i) {
                int nx = x + dx[i],
                    ny = y + dy[i];

                if (nx == gx && ny == gy) {
                    std::cout << "YES" << std::endl;
                    return;
                }

                nque.emplace(nx, ny);
            }
        }

        std::swap(que, nque);
    }

    std::cout << "NO" << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}