using System; using System.Linq; using System.Text; using System.Collections.Generic; using STR = System.String; using INT = System.Int64; using DEC = System.Double; class Program { public static IO IO = new IO(); static void Main(string[] args) { INT[] xy = IO.INT(' '); PAIR, INT> a = new PAIR, INT>(new POINT(xy[0], xy[1], 0), 0); BFSPOINT q = new BFSPOINT(100, -100); string o = "NO"; q.PUSH(0, 0, 0, 0); while (q.SIZE() != 0) { PAIR, INT> x = q.POP(); if (x.SAME(a)) { o = "YES"; break; } if (x.VALUE < 3) { x.VALUE++; q.PUSH(x.KEY.X - 2, x.KEY.Y - 1, x.KEY.Z, x.VALUE); q.PUSH(x.KEY.X - 2, x.KEY.Y + 1, x.KEY.Z, x.VALUE); q.PUSH(x.KEY.X - 1, x.KEY.Y - 2, x.KEY.Z, x.VALUE); q.PUSH(x.KEY.X - 1, x.KEY.Y + 2, x.KEY.Z, x.VALUE); q.PUSH(x.KEY.X + 1, x.KEY.Y - 2, x.KEY.Z, x.VALUE); q.PUSH(x.KEY.X + 1, x.KEY.Y + 2, x.KEY.Z, x.VALUE); q.PUSH(x.KEY.X + 2, x.KEY.Y - 1, x.KEY.Z, x.VALUE); q.PUSH(x.KEY.X + 2, x.KEY.Y + 1, x.KEY.Z, x.VALUE); } } IO.WRITE(o); IO.FLUSH(); } public static int BIT(INT n) { int ret = 0; for (int i = 0; i < 32; i++) { if ((1 << i & n) != 0) { ret++; } } return ret; } } public class BFSPOINT : QUEUE, T>> { private bool[,,] f; private INT MIN; public BFSPOINT(INT max, INT min = 0) : base(max) { MIN = min; f = new bool[max - min, max - min, max - min]; } public void PUSH(INT x, INT y, INT z, T value) { PUSH(new PAIR, T>(new POINT(x, y, z), value)); } public override void PUSH(PAIR, T> v) { POINT k = v.KEY; INT x = k.X - MIN; INT y = k.Y - MIN; INT z = k.Z - MIN; INT max = m - MIN; if (x >= 0 && x < max && y >= 0 && y < max && z >= 0 && z < max && !f[x, y, z]) { f[x, y, z] = true; base.PUSH(v); } } } public class POINT : IEquatable> where T : IEquatable { public T X; public T Y; public T Z; public POINT(T x, T y, T z) { X = x; Y = y; Z = z; } public bool SAME(POINT b) { return Equals(b); } public bool Equals(POINT b) { return X.Equals(b.X) && Y.Equals(b.Y) && Z.Equals(b.Z); } } public class QUEUE { protected INT m; private INT s, e, c; private T[] q; public QUEUE(INT max) { m = max; q = new T[m]; CLEAR(); } public void CLEAR() { e = 0; s = 0; c = 0; } public INT SIZE() { return c; } public T TOP() { return q[0]; } public T POP() { T r = q[s++]; s %= m; c--; return r; } public virtual void PUSH(T v) { q[e++] = v; e %= m; c++; } public bool EMPTY() { return SIZE() == 0; } } public class PAIR : IEquatable> where T : IEquatable { public T KEY; public U VALUE; public PAIR(T key, U value) { KEY = key; VALUE = value; } public bool SAME(PAIR b) { return Equals(b); } public bool Equals(PAIR b) { return KEY.Equals(b.KEY); } } public class IO { private const int WMAX = 1000; private StringBuilder S = new StringBuilder(); private T R(Func f) { return f(Console.ReadLine()); } private T[] R(Func f, char c) { return STR().Split(c).Select(f).ToArray(); } private T[] R(Func f, int l) { T[] r = new T[l]; for (int i = 0; i < l; i++) { r[i] = R(f); } return r; } private T[][] R(Func f, int l, char c) { T[][] r = new T[l][]; for (int i = 0; i < l; i++) { r[i] = R(f, c); } return r; } private void W(Func f, T v, bool lf = true) { S.Append(f(v)); if (lf) { S.Append('\n'); } if (S.Length >= WMAX) { FLUSH(); } } public STR STR() { return R(s => s); } public STR[] STR(char c) { return R(s => s, c); } public STR[] STR(int l) { return R(s => s, l); } public STR[][] STR(int l, char c) { return R(s => s, l, c); } public INT INT() { return R(long.Parse); } public INT[] INT(char c) { return R(long.Parse, c); } public INT[] INT(int l) { return R(long.Parse, l); } public INT[][] INT(int l, char c) { return R(long.Parse, l, c); } public DEC DEC() { return R(double.Parse); } public DEC[] DEC(char c) { return R(double.Parse, c); } public DEC[] DEC(int l) { return R(double.Parse, l); } public DEC[][] DEC(int l, char c) { return R(double.Parse, l, c); } public void WRITE(object s, bool lf = true) { W(v => v.ToString(), s, lf); } public void FLUSH() { Console.Write(S); S.Length = 0; } }