import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


H, W, C = map(int, input().split())
visited = [[False for _ in range(W)] for _ in range(H)]


def dfs(r, c, cnt):
    if cnt == H * W - 1 and r + c == 1:
        print('YES')
        exit()
    visited[r][c] = True
    darr = [(1, 0), (0, 1), (-1, 0), (0, -1)]
    for dr, dc in darr:
        ar, ac = r + dr, c + dc
        if ar < 0 or ar > H - 1 or ac < 0 or ac > W - 1:
            continue
        if visited[ar][ac]:
            continue
        dfs(ar, ac, cnt + 1)
    visited[r][c] = False


dfs(0, 0, 0)
print('NO')