import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.*; public class Main { boolean[][] can = new boolean[20][20]; void solve() throws IOException { int x = ni() + 10; int y = ni() + 10; if (x < 0 || x >= 20 || y < 0 || y >= 20) { out.println("NO"); } else { dfs(10, 10, 3); out.println(can[x][y] ? "YES" : "NO"); } } int[] dx = {2, 1, -1, -2, -2, -1, 1, 2}; int[] dy = {1, 2, 2, 1, -1, -2, -2, -1}; void dfs(int x, int y, int m) { can[x][y] = true; if (m > 0) { for (int i = 0; i < 8; i++) { dfs(x + dx[i], y + dy[i], m - 1); } } } String ns() throws IOException { while (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine(), " "); } return tok.nextToken(); } int ni() throws IOException { return Integer.parseInt(ns()); } long nl() throws IOException { return Long.parseLong(ns()); } double nd() throws IOException { return Double.parseDouble(ns()); } String[] nsa(int n) throws IOException { String[] res = new String[n]; for (int i = 0; i < n; i++) { res[i] = ns(); } return res; } int[] nia(int n) throws IOException { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = ni(); } return res; } long[] nla(int n) throws IOException { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nl(); } return res; } class INA { int[][] a; INA(int n, int m) throws IOException { this(n, m, -1); } INA(int n, int m, int t) throws IOException { a = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { a[j][i] = ni() + t; } } } int[] get(int i) { return a[i - 1]; } } static BufferedReader in; static PrintWriter out; static StringTokenizer tok; public static void main(String[] args) throws IOException { in = new BufferedReader(new InputStreamReader(System.in)); out = new PrintWriter(System.out); tok = new StringTokenizer(""); Main main = new Main(); main.solve(); out.close(); } }