di = [-1, 1, 2, 2, 1, -1, -2, -2]
dj = [2, 2, 1, -1, -2, -2, -1, 1]

x, y = map(int, input().split())

def dfs(i, j, c):
    if i == x and j == y:
        print("YES")
        exit()
    elif c == 3:
        return
    
    for k in range(8):
        dfs(i + di[k], j + dj[k], c + 1)
    
dfs(0, 0, 0)
print("NO")