import std.algorithm, std.array, std.container, std.range, std.bitmanip;
import std.numeric, std.math, std.bigint, std.random, core.bitop;
import std.string, std.regex, std.conv, std.stdio, std.typecons;

void main()
{
  auto rd = readln.split.map!(to!int);
  auto x = rd[0], y = rd[1];

  auto j1 = jump([point(0, 0)]);
  auto j2 = jump(j1);
  auto j3 = jump(j2);
  auto j = j1 ~ j2 ~ j3;

  writeln(j.canFind(point(x, y)) ? "YES" : "NO");
}

point[] jump(point[] pi)
{
  return pi.map!(p => knightJumps.map!(a => p + a).array).reduce!("a ~ b");
}

struct Point(T) {
  T x, y;

  point opBinary(string op)(point rhs) {
    static if (op == "+") return point(x + rhs.x, y + rhs.y);
    else static if (op == "-") return point(x - rhs.x, y - rhs.y);
  }
}

alias Point!int point;

const auto knightJumps = [point(-2, -1), point(-2, +1), point(-1, -2), point(-1, +2),
                          point(+1, -2), point(+1, +2), point(+2, -1), point(+2, +1)];