Problem:
 Score : 200 points    Problem Statement We have a grid with N rows and M columns of squares. Initially, all the squares are white.  There is a button attached to each row and each column.
When a button attached to a row is pressed, the colors of all the squares in that row are inverted; that is, white squares become black and vice versa.
When a button attached to a column is pressed, the colors of all the squares in that column are inverted.  Takahashi can freely press the buttons any number of times. Determine whether he can have exactly K black squares in the grid.      Constraints  1 \leq N,M \leq 1000  0 \leq K \leq NM         Input Input is given from Standard Input in the following format:  N  M  K       Output If Takahashi can have exactly K black squares in the grid, print Yes ; otherwise, print No .        Sample Input 1 2 2 2      Sample Output 1 Yes  Press the buttons in the order of the first row, the first column.       Sample Input 2 2 2 1      Sample Output 2 No       Sample Input 3 3 5 8      Sample Output 3 Yes  Press the buttons in the order of the first column, third column, second row, fifth column.       Sample Input 4 7 9 20      Sample Output 4 No

Solution (Python):
N, M, K = map(int, input().split())
yes = False
for i in range(0, N + 1):
    for j in range(0, M + 1):
        if K == i * j + (N - i) * (M - j):
            yes = True
            break
    if yes:
        break
        
if yes:
    print("Yes")
else:
    print("No")

Solution (Python):
N, M, K = map(int, input().split())
flag = False
for i in range(0, N+1):
    for j in range(0, M+1):
        if (i*(M-j)+j*(N-i)) == K:
            flag = True
if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
N, M, K = map(int, input().split())
flag = True
for i in range(0, N+1):
    for j in range(0, M+1):
        if (i*(M-j)+j*(N-i)) == K:
            print("Yes")
            flag = False
            break
    if not(flag):
        break
if flag:
    print("No")

Solution (Python):
def solve():
    N, M, K = [int(i) for i in input().split()]
    for k in range(N + 1):
        for l in range(M + 1):
            if k * (M - l) + (N - k) * l == K:
                return True
    return False

if solve():
    print("Yes")
else:
    print("No")

Solution (Python):
n,m,k = map(int, input().split())

def solve():
    for i in range(n+1):
        for j in range(m+1):
            if i*(m-j) + j*(n-i) == k:
                return True
    return False
                
print("Yes" if solve() else "No")

Solution (Python):
H,W,k=map(int,input().split());x="No"
for h in range(H+1):
  for w in range(W+1):
    if h*w+(H-h)*(W-w)==k:
      x="Yes"
      break
  if x=="Yes":break
print(x)

Solution (Python):

import sys
sys.setrecursionlimit(10**7)
import math
from collections import defaultdict


mod = 10**9 + 7


def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N):
  read_all = [tuple(map(int, input().split())) for _ in range(N)]
  return map(list,zip(*read_all))



N,M,K = II()
val = N*M-K
ans = 'No'
for i in range(N+1):
  for j in range(M+1):
    if i*M+j*N-2*i*j==K:
      ans ='Yes'
      break
print(ans)

Solution (Python):
def solve(w, h, k):
    for y in range(h+1):
        if h == 2*y:
            continue
        x = (k - y*w) // (h - 2*y)
        if not (0 <= x <= w):
            continue
        s = x * (h-y) + (w-x) * y
        if s == k:
            return "Yes"
    return "No"

n, m, k = map(int, input().split())
print(solve(n, m, k))

Solution (Python):
n,m,k = map(int,input().split())

for i in range(m+1):
    a = k - i * n
    b = m - 2 * i
    if b != 0 and a % b == 0 and 0 <= a // b <= n:
        print('Yes')
        exit()
print('No')

Solution (Python):
n,m,k = map(int,input().split())

for i in range(m+1):
  for j in range(n+1):
    if n*i + m*j - 2*i*j == k:
      print('Yes')
      exit()
print('No')

Solution (Python):
n, m, k = map(int, input().split())
for i in range(n+1):
    for j in range(m+1):
        if i*m+j*n-2*i*j == k:
            print('Yes')
            exit()
print('No')

Solution (Python):
N, M, K = map(int,input().split())
V = []
for i in range(N+1):
    for j in range(M+1):
        V.append(M*i + (N-2*i)*j)

if K in V:
    print("Yes")
else:
    print("No")

Solution (Python):
n,m,k=map(int,input().split())

for i in range(n+1):
    for j in range(m+1):
        if n*j+m*i-2*i*j==k:
            print("Yes")
            import sys
            sys.exit()
print("No")

Solution (Python):
N,M,K=map(int,input().split())

for a in range(N+1):
    for b in range(M+1):
        if M*a+N*b-2*(a*b)==K:
            print('Yes')
            exit()
print('No')

Solution (Python):

def main():
    n, m, k = list(map(int, input().rstrip().split()))
    for i in range(n + 1):
        for j in range(m + 1):
            if i * (m - j) + j * (n - i) == k:
                print("Yes")
                return
    else:
        print("No")


if __name__ == "__main__":
    main()

Solution (Python):
def main():
    N, M, K = map(int, input().split())
    for i in range(N+1):
        for j in range(M+1):
            b = M * i + N * j - (i * j) * 2
            if K == b:
                print("Yes")
                return
    print("No")


if __name__ == "__main__":
    main()

Solution (Python):
N,M,K = [int(x) for x in input().split()]
flag = False
for y in range(N+1):
    if(N-2*y==0):
        continue
    x = (K-M*y)/(N-2*y)
    if(int(x)==x and 0<=x<=M):
        flag = True
        break

if(flag):
    print('Yes')
else:
    print('No')

Solution (Python):
n,m,k=map(int,input().split())
cnt=0
for i in range(n+1):
    for j in range(m+1):
        if i*(m-j)+j*(n-i)==k:
            cnt=1
if cnt==1:
    print('Yes')
else:
    print('No')

Solution (Python):
n, m, k = [int(i) for i in input().split()]

flag = False
for y in range((n+1)//2+1):
    for x in range((m+1)//2+1):
        a = x*y + (m-x)*(n-y)
        b = n*m - a
        if k in [a, b]:
            flag = True
            break
    if flag:
        break

if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
from itertools import product

N, M, K = map(int, input().split())
for i, j in product(range(N+1), range(M+1)):
    black = (M - j) * i + (N - i) * j
    if black == K:
        print('Yes')
        break
else:
    print('No')

Solution (Python):
N,M,K = map(int,input().split())

bl = False
for n in range(N+1):
  x = n*M
  if x == K:
    bl = True
    break
  
  d = N - 2 * n
  if d == 0:
    continue
  if (K-x) % d:
    continue
  m = (K - x) // d
  if 0 <= m <= M:
    bl = True
    break

answer = 'Yes' if bl else 'No'
print(answer)

Solution (Python):
n, m, K = map(int, input().split())
for k in range(n + 1):
    if n - 2 * k != 0 and (K - k * m) % (n - 2 * k) == 0 and 0 <= (K - k * m) / (n - 2 * k) <= m:
        print('Yes')
        exit(0)
else:
    print('No')

Solution (Python):
n,m,k = map(int,input().split())
for i in range(n+1):
    for j in range(m+1):
        if (i*m+j*n)-(i*j*2)==k:
            print("Yes")
            exit()
print("No")

Solution (Python):
n,m,k=map(int,input().split())
for i in range(n+1):
    for j in range(m+1):
        if(i*j+(n-i)*(m-j)==k):
            print("Yes")
            quit()
print("No")

Solution (Python):

"""
B - fLIP
https://atcoder.jp/contests/code-festival-2017-quala/tasks/code_festival_2017_quala_b

"""
import sys


def solve(N, M, K):
    if K%N == 0 or K%M == 0:
        return 'Yes'
    for y in range(N+1):
        for x in range(M+1):
            if x * y + (N - y) * (M - x) == K:
                return 'Yes'
    return 'No'


def main(args):
    N, M, K = map(int, input().split())
    ans = solve(N, M, K)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Solution (Python):
n,m,k=map(int,input().split())
for i in range(n+1):
    for j in range(m+1):
        x=i*(m-j)+j*(n-i)
        if x>=k:break
    if x==k:
        print("Yes")
        break
else:print("No")

Solution (Python):
N,M,K=map(int,input().split())
for n in range(N+1):
    for m in range(M+1):
        if (n*m+(N-n)*(M-m))==K:
            print("Yes")
            exit()
print("No")

Solution (Python):
n,m,k = map(int,input().split())

for i in range(n+1):
    for j in range(m+1):
        if (n-i)*j + (m-j)*i == k:
            print('Yes')
            exit()

print('No')

Solution (Python):
N, M, K = map(int, input().split())
flag = False
for i in range(N+1):
    for j in range(M+1):
        cnt = i*M+j*N-2*i*j
        if cnt == K:
            flag = True
            break
    if flag:
        break
if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
n,m,k = map(int,input().split())
p = abs(2*k-n*m)

a = n
while a>0:
  if p%a == 0 and p//a <= m and (p//a)%2 == m%2:
    print("Yes")
    quit()
  elif p > a*m:
    break  
  a -= 2
print("No")

Solution (Python):
n,m,k = map(int, input().split())
def check():
    globals()
    for i in range(n+1):
        for j in range(m+1):
            if j*(n-i)+i*(m-j)==k:
                return True
    return False
if check():
    print('Yes')
else:
    print('No')

Solution (Python):
n,m,k=map(int,input().split())
flag=0
for i in range(n+1):
  for j in range(m+1):
    if i*(m-j)+(n-i)*j==k:
      flag=1
print("Yes" if flag==1 else "No")

Solution (Python):
N,M,K=map(int,input().split())
flag=0
for i in range(N+1):
    for j in range(M+1):
        if i*(M-j)+(N-i)*j == K:
            flag=1
            print("Yes")
            break
    if flag==1:
        break
else:
    print("No")

Solution (Python):
n,m,k=map(int,input().split())
ans=['Yes','No']
i=1
for a in range(n+1):
    for b in range(m+1):
        if k==a*m+b*n-2*a*b:
            i=0
print(ans[i])

Solution (Python):
N,M,K=map(int,input().split())
ans=False
for a in range(N+1):
    for b in range(M+1):
        if K==a*b+(N-a)*(M-b):
            ans=True
            break
    if ans:break
if ans:print("Yes")
else:print("No")

Solution (Python):
n,m,k = map(int,input().split())
for x in range(n+1):
    for y in range(m+1):
        if (m-y)*x + (n-x)*y == k:
            print("Yes")
            exit()
print("No")

Solution (Python):
H,W,K = map(int,input().split())

ans = "No"

for i in range(H+1):
    if H-2*i == 0:
        if K-W*i == 0:
            ans = "Yes"
        else:
            continue
    if (K-W*i) % (H-2*i) != 0:
        continue
    j = (K-W*i) // (H-2*i)
    if 0 <= j <= W:
        ans = "Yes"
        break

print(ans)

Solution (Python):
H,W,K = map(int,input().split())

ans = "No"

for i in range(H+1):
    for j in range(W+1):
        if H*j + W*i - 2*i*j == K:
            ans = "Yes"
            break

print(ans)

Solution (Python):
n,m,k=map(int,input().split())
flag=False
if n==1 or m==1:
  print('Yes')
else:
  for i in range(n+1):
    for j in range(m+1):
      if i*j + (n-i)*(m-j) + k == n*m:
        flag=True
  if flag:
    print('Yes')
  else:
    print('No')

Solution (Python):
N, M, K = [int(x) for x in input().split()]

def n_black(n, m):
    return (N - n) * m + (M - m) * n

ans = False
for i in range(N + 1):
    for j in range(M + 1):
        if n_black(i, j) == K:
            ans = True

print("Yes" if ans else "No")

Solution (Python):
n,m,k=map(int,input().split())
s=set()
for i in range(n+1):
  for j in range(m+1):
    s.add(i*(m-j)+(n-i)*j)
if k in s:
  print("Yes")
else:
  print("No")

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N,M,K=MAP()

for i in range(N+1):
    for j in range(M+1):
        if i*(M-j)+j*(N-i)==K:
            Yes()
            exit()
No()

Solution (Python):
N, M, K = map(int, input().split())
flag = 0
for i in range(N+1):
  for j in range(M+1):
    if (N-i)*j + i*(M-j) == K:
      flag = 1
if flag == 1:
  print("Yes")
else:
  print("No")

Solution (Python):
n, m, k = map(int, input().split())
is_black = False

for i in range(n+1):
  for j in range(m+1):
    if i * (m - j) + j * (n - i) == k:
      is_black = True
      break

if is_black:
  print('Yes')
else:
  print('No')

Solution (Python):
n,m,k=map(int,input().split())
def abyabya(a):
  global k,n,m
  if n*m-a==k:
    print("Yes")
    exit()
for i in range(n+1):
  for j in range(m+1):abyabya(i*j+(n-i)*(m-j))
print("No")

Solution (Python):
from itertools import product

N, M, K = map(int, input().split())
S = set()

for i, j in product(range(N+1), range(M+1)):
    S.add((M-j)*i + (N-i)*j)

print("Yes" if K in S else "No")

Solution (Python):
a,b,k=map(int,input().split());print('YNeos'[all(k!=(b-j)*i+j*(a-i)for i in range(a+1)for j in range(b+1))::2])

Solution (Python):
a,b,k=map(int,input().split());print("NYoe s"[1in[k==(b-t)*s+t*(a-s)for t in range(b+1)for s in range(a+1)]::2])

Solution (Python):
a,b,k=map(int,input().split())
for s in range(a+1):
    for t in range(b+1):
        if k==(b-t)*s+(a-s)*t:
            print("Yes")
            exit()
print("No")

Solution (Python):



def main():
    n, m, k = map(int, input().split())

    for i in range(n + 1):
        for j in range(m + 1):
            if i * (m - j) + j * (n - i) == k:
                print('Yes')
                exit()

    print('No')


if __name__ == '__main__':
    main()

Solution (Python):
N,M,K = map(int,input().split())
for i in range(N+1):
  for j in range(M+1):
    if i*(M-j) + (N-i)*j == K:
      print("Yes")
      break
  else:
    continue
  break
else:
  print("No")

Solution (Python):

n,m,k = map(int, input().split())
for i in range(n+1):
  if 2*i == n:
    if i*m == k:
      print("Yes")
      break
  else:
    t = k-i*m
    s = n-2*i
    if t%s==0 and 0<=t//s<=m:
      print("Yes")
      break
else:
  print("No")

Solution (Python):
N,M,K=map(int,input().split(' '))
print('Yes') if K in [(N-a)*b+(M-b)*a for a in range(N+1) for b in range(M+1)] else print('No')

Solution (Python):
n,m,k = map(int,input().split())
for i in range(n+1):
	for j in range(m+1):
		if i*(m - j) + j*(n - i) == k:
			print("Yes")
			exit()
print("No")

Solution (Python):
n,m,k = map(int,input().split())
for i in range(n+1):
	for j in range(m+1):
		if i*(m - j) + j*(n - i) == k:
			print("Yes")
			exit()
print("No")

Solution (Python):
N,M,K = map(int,input().split())
ansx = -1
ansy = -1
for k in range(N+1):
  for l in range(M+1):
    if k*(M-l)+l*(N-k) == K:
      ansx = k
      ansy = l
if ansx == -1 and ansy == -1:
  print('No')
else:
  print('Yes')

Solution (Python):
n,m,k=map(int,input().split())
f=False
for i in range(n+1):
  for j in range(m+1):
    if i*(m-j)+j*(n-i)==k:
      f=True
if f:
  print('Yes')
else:
  print('No')

Solution (Python):
n, m, k = map(int, input().split())
gyoli = []
for i in range(n + 1):
  gyoli.append(i)
candiset = set()
for j in range(m + 1):
  for gyo in gyoli:
    candiset.add(gyo*j + (n-gyo)*(m-j))
if k in candiset:
  print("Yes")
else:
  print("No")

Solution (Python):
n,m,k = (int(i) for i in input().split())
ans = 'No'
for i in range(n+1):
  for j in range(m+1):
    if i*(m-j)+j*(n-i) == k:
      ans = 'Yes'
      break
print(ans)

Solution (Python):
n,m,k=map(int,input().split())
s=[]
for i in range(n+1):
    for j in range(m+1):
        s.append((n-i)*(m-j)+i*j)
print("Yes"if k in s else"No")

Solution (Python):
N, M, K = map(int, input().split())
for k in range(0,N+1):
    for l in range(0,M+1):
        if K == (k*(M - l) + (N - k)*l):
            print("Yes")
            quit()
print("No")

Solution (Python):

def LI(): return list(map(int, input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()
def LIR(n): return [LI() for i in range(n)]


"""
s = S()
if s[0] != "A":
    print("WA")
else:
    count = []
    for i in range(2,len(s)-1):
        if s[i] == "C": count.append(i)
    if len(count) != 1:
        print("WA")
    else:
        for i in range(1,len(s)):
            if i not in count:
                if s[i] == s[i].upper():
                    print("WA")
                    quit()
        print("AC")
"""


n,m,k = LI()
for i in range((n+1)//2):
    if (k - m*i) % (n - 2*i) == 0 and (k-m*i)//(n-2*i) >= 0 and (k-m*i)//(n-2*i) <= m:
        print("Yes")
        quit()
print("No")

Solution (Python):
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

n,m,k = li()

exist = False
for i in range(n+1):
    for j in range(m+1):
        if (i*m + j*n - 2*i*j) == k:
            
            exist = True
            
print("Yes") if exist else print("No")

Solution (Python):
N,M,K = map(int,input().split())
for i in range(N+1):
    for j in range(M+1):
        if (N-i)*j + (M-j)*i == K:
            print('Yes')
            exit()
print('No')

Solution (Python):
n,m,k = map(int,input().split())
for i in range(n+1):
    for j in range(m+1):
        a = (n-i)*j + (m-j)*i
        if a == k:
            print('Yes')
            exit()
print('No')

Solution (Python):
N,M,K = map(int,input().split())

for n in range(N+1):
    for m in range(M+1):
        cnt = n*M + m*N - n*m*2
        if cnt == K:
            print('Yes')
            exit()
print('No')

Solution (Python):
n,m,k = map(int,input().split())
for a in range(n+1):
    
    black = a * m
    for b in range(m+1):
        
        res = black + b * (n - 2 * a)
        if res == k:
            print('Yes')
            exit()
print('No')

Solution (Python):
import itertools
N, M, K = [int(_) for _ in input().split()]
for i, j in itertools.product(range(N+1), range(M+1)):
    if (N-i)*j+i*(M-j) == K:
        print('Yes')
        exit()
print('No')

Solution (Python):
n,m,k=map(int,input().split())
t=False
for i in range(n+1):
    for j in range(m+1):
        if (n-i)*j+(m-j)*i==k:
            t=True
            break
print("Yes" if t else "No")

Solution (Python):
N, M, K = map(int, input().split())
"""
N=3, M=5

xxxxx
xxxxx
xxxxx
"""

def check(KS):
  for i in range(N+1):
    
    
    if N == 2*i:
      if i*M == KS:
        print("Yes")
        exit(0)
      else:
        continue
    if (KS - i*M) % (N-2*i) == 0 :
      sho = (KS - i*M) // (N-2*i)
      if 0 <= sho and sho <= M:
        print('Yes')
        exit(0)

check(K)



print('No')

Solution (Python):
N,M,K = map(int,input().split())
A = []

for y in range(1,N+1) :
    for x in range(1,M+1) :
        a = y*x + (N-y)*(M-x)
        A.append(a)
        A.append(N*M-a)
if K in A :
    print("Yes")
else :
    print("No")

Solution (Python):
N, M, K = map(int,input().split())
if K%N==0 or K%M==0:
    print("Yes")
    exit()

for n in range(1,N):
    for m in range(1,M):
        if n*m + (N-n)*(M-m) == K:
            print("Yes")
            exit()
print("No")

Solution (Python):
n,m,k=map(int,input().split())
for i in range(n+1):
    for j in range(m+1):
        if i*(m-j)+j*(n-i)==k:
            print('Yes')
            exit()
print('No')

Solution (Python):
n,m,k=map(int,input().split())
for i in range(n+1):
    for j in range(m+1):
        if i*(m-j)+j*(n-i)==k:
            print('Yes')
            exit()
print('No')

Solution (Python):
n,m,k=map(int, input().split())
a=[]
for i in range(n+1):
    for j in range(m+1):
        a.append(i*m+j*n-2*i*j)
if k in a:print('Yes')
else:print('No')

Solution (Python):
N, M, K = list(map(int, input().split()))
L = [0 for i in range(N * M + 1)]
L[0] = 1

for x in range(M + 1):
	for y in range(N + 1):
		L[x * (N - y) + y * (M - x)] += 1

if L[K] >= 1: 
	print("Yes")
else:
	print("No")

Solution (Python):
n,m,k = map(int,input().split())

for i in range(n+1):
    for j in range(m+1):
        if i*(m-j)+(n-i)*j==k:
            print('Yes')
            exit()

print('No')

Solution (Python):
P = input().split()
N = int(P[0])
M = int(P[1])
K = int(P[2])


for i in range(0,N+1):
    for j in range(0,M+1):
        if((M - j) * i + (N - i) * j == K):
            print("Yes")
            exit()
print("No")

Solution (Python):
N, M, K = list(map(int, input().split()))

res = "No"
for i in range(N+1):
	for j in range(M+1):
		num = (M * i + N * j - 2 * i * j)
		if num == K:
			res = "Yes"
			break
print(res)

Solution (Python):
n, m, k = map(int, input().split())
for i in range(n+1):
    for j in range(m+1):
        if i*m + j*n -2*i*j == k:
            print('Yes')
            exit()
print('No')

Solution (Python):
n,m,k=map(int,input().split())
a='No'
for i in range(n+1):
  for j in range(m+1):
    if j*(n-i)+i*(m-j)==k:
      a='Yes'
      break
print(a)

Solution (Python):
n,m,k = map(int, input().split())
for p in range(0,n+1):
    for q in range(0,m+1):
        if k == m*p + n*q - 2*p*q:
            print("Yes")
            break
    else:
        continue
    break
else:
    print("No")

Solution (Python):
n, m, k = [int(_) for _ in input().split()]

ans = 'No'
for i in range(n+1):
    for j in range(m+1):
        total = m * i + n * j - 2 * i * j
        if total == k:
            ans = 'Yes'
print(ans)

Solution (Python):
N, M, K = map(int, input().split())
ans = -1
for i in range(N + 1):
    for j in range(M + 1):
        if K == M * i + N * j - i * j * 2:
            ans = 1
            break
if ans == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
n,m,k = map(int,input().split())

flag = False

for i in range(0,n+1):
    for j in range(0,m+1):
        black = i*(m-j) + j*(n-i)

        if black == k:
            flag = True


if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
n,m,k=map(int,input().split())
s=[]
u=n
for i in range(1,n+1):
    u-=2
    for j in range(m+1):
        s.append(m*i+u*j)
if k in s:
    print("Yes")
else:
    print("No")

Solution (Python):
n, m, k = map(int, input().split())
for a in range(n+1):
    for b in range(m+1):
        if a*b + (n-a)*(m-b) == k:
            print("Yes")
            exit()
print("No")

Solution (Python):
N,M,K=map(int,input().split());s=set();[s.add(j*(N-i)+i*(M-j)) for i in range(N+1) for j in range(M+1)];print("Yes" if K in s else "No")

Solution (Python):
N,M,K=map(int,input().split())
s=set()
for i in range(N+1):
    for j in range(M+1):
        s.add(j*(N-i)+i*(M-j))
print("Yes" if K in s else "No")

Solution (Python):
N, M, K = list(map(int,input().strip().split(' ')))
import itertools
flg = 0
for i,j in itertools.product([k for k in range(N+1)],[k for k in range(M+1)]):
    kuro = M * i + N * j -2 * i * j
    if kuro == K:
        flg = 1
        break

if flg == 1:
    print('Yes')
else:
    print('No')

Solution (Python):
N, M, K = map(int, input().split())
L = set()
for i in range(N+1):
    for j in range(M+1):
        L.add(i*j+(N-i)*(M-j))
print("Yes" if K in L else "No")

Solution (Python):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())

N,M,K = inpl()

for x in range(N+1):
    for y in range(M+1):
        tmp = x*M+y*N-x*y*2
        if tmp == K:
            print('Yes')
            sys.exit()
print('No')

Solution (Python):

from sys import stdin

in_strings = lambda: stdin.readline()[:-1] 
in_int = lambda: int(stdin.readline()) 
in_intlist = lambda: list(map(int, stdin.readline().split())) 

N, M, K = in_intlist()

for n in range(N+1):
    if n == N/2:
        continue
    if (K - M*n) / (N - 2*n) == (K - M*n) // (N - 2*n):
        if 0 <= (K - M*n) / (N - 2*n) <= M:
            print('Yes')
            exit()

print('No')

Solution (Python):
N, M, K = map(int, input().split())


for a in range(N+1):
    for b in range(M+1):
        if b * (N-a) + a * (M-b) == K:
            print('Yes')
            exit()


print('No')

Solution (Python):
N, M, K = map( int, input().split())
Flag = False
ans = 'No'
for i in range(N+1):
    for j in range(M+1):
        if (M-j)*i + (N-i)*j == K:
            ans = 'Yes'
            Flag = True
            break
    if Flag == True:
        break
print(ans)

Solution (Python):
n, m, k = map(int, input().split())
for i in range(n + 1):
    for j in range(m + 1):
        if i * m + j * n - 2 * i * j == k:
            print("Yes")
            exit()
print("No")

Solution (Python):
n, m, k = map(int, input().split())
for i in range(n + 1):
    for j in range(m + 1):
        if i * (m - j) + j * (n - i) == k:
            print("Yes")
            exit()
print("No")

Solution (Python):
N, M, K = map(int, input().split())
for i in range(M + 1):
    for j in range(N + 1):
        if K == i * (N - j) + j * (M - i):
            print('Yes')
            exit()
print('No')

Solution (Python):
N,M,K=map(int,input().split())
for k in range(N+1):
  for l in range(M+1):
    v=k*(M-l)+l*(N-k)
    if v==K:
      print("Yes")
      exit()
print("No")

Solution (Python):
n,m,k = list(map(int, input().split()))
done = 0
for i in range(n+1):
    for j in range(m+1):
        r = i*(m-j)+j*(n-i)
        if r == k:
            print('Yes')
            done = 1
            break
    if done == 1:break
if done == 0:print('No')

Solution (Python):
def solve(N,M,K):
  for a in xrange(N+1):
    for b in xrange(M+1):
      if a*b + (N-a)*(M-b) == K:
        return True
  return False
N,M,K = map(int,raw_input().split())
if solve(N,M,K):
  print 'Yes'
else:
  print 'No'

Solution (Python):
N, M, K = map(int, input().split())

for i in range(N+1):
    for j in range(M+1):
        if K == (N-i)*j + (M-j)*i:
            print("Yes")
            exit()

print("No")

Solution (Python):
'''
黒マスの条件
行ボタン押 and (not 列ボタン押)
(not 行ボタン押） and 列ボタン押

行列の押したボタンは上左詰めできるので、
位置は関係がない
押したボタン数を考えたらよい

k, lを行、列ボタンの押下数とする
'''

N, M, K = map(int, input().split())
flg = False
for k in range( N+1):
    for l in range(M+1):
        if K == k * (M - l) + l * (N - k):
            flg = True
            break
print('Yes' if flg else 'No')

Solution (Python):
N, M, K = map(int, input().split())

for k in range(N+1):
    for l in range(M+1):
        if l*(N-k)+k*(M-l)==K:
            print("Yes")
            exit(0)
print("No")

Solution (Python):
N,M,K = [int(i) for i in input().split()]

ans = 'No'
for j in range(N+1):
  for k in range(M+1):
    if j * (M - k) + k * (N - j) == K:
      ans = 'Yes'
print(ans)

Solution (Python):
N,M,K=map(int,input().split())
for i in range(N+1):
  for j in range(M+1):
    if i*(M-j) + j*(N-i) == K:
      print('Yes')
      exit()
print('No')

Solution (Python):
n,m,k = (int(i) for i in input().split())
flag = False
for i in range(0,m+1):
	for j in range(0,n+1):
		if k==i*n+j*m-2*i*j:
			flag = True
			break
	if flag: break
if flag: print("Yes")
else: print("No")

Solution (Python):
n,m,k=map(int,input().split())
end = 0
for i in range(0, n+1):
    for j in range(0, m+1):
        if m*i+n*j-2*(i*j)==k:
            print("Yes")
            end = 1
            break
    if end == 1:
        break
else:
    print("No")

Solution (Python):
N,M,K = map(int,input().split())

P = []
for i in range(0,N+1):
    for j in range(0,M+1):
        p = (i*j) + ((N-i)*(M-j))
        P.append(p)
        
if K in P:
    print("Yes")
else:
    print("No")

Solution (Python):
n,m,k = list(map(int,input().split()))
ans = 'No'
for i in range(n+1):
    for j in range(m+1):
        if i * m + j * n - 2 * i * j == k:
            ans = 'Yes'

print(ans)

Solution (Python):
n,m,k=map(int,input().split())
for i in range(n+1):
    for j in range(m+1):
        if m*i+n*j-2*(i*j)==k:
            print("Yes")
            exit()
print("No")

Solution (Python):
n,m,k = map(int,input().split())
s = []
for i in range(n+1):
    for j in range(m+1):
        hoge = (i*j+(n-i)*(m-j))
        s.append(hoge)
        s.append(n*m-hoge)
if k in s:
    print("Yes")
else:
    print("No")

Solution (Python):
def fLIP(N,M,K):
  for l in range(N+1):
    for k in range(M+1):
      P=l*(M-k)+k*(N-l)
      if P==K:
        return "Yes"
  return "No"

n,m,k=map(int,input().split())
print(fLIP(n,m,k))

Solution (Python):
import sys


n,m,k=map(int,input().split())
flag=0
for i in range(n+1):
    for j in range(m+1):
        if((i*(m-j)+j*(n-i))==k):
            flag=1
            break
if(flag):print("Yes")
else:print("No")

Solution (Python):



def check_flip(N, M, K):
    for i in range(N+1):
        for j in range(M+1):
            if (N-i)*j + (M-j)*i == K:
                return True
    return False


if __name__ == '__main__':
    N, M, K = map(int, input().split())
    if check_flip(N, M, K):
        print('Yes')
    else:
        print('No')

Solution (Python):
def main():
    N, M, K = map(int, input().split())

    editorial(N, M, K)

def editorial(N, M, K):
    for k in range(N+1):
        for l in range(M+1):
            
            
            x = k * (M - l) + (N - k) * l
            if x == K:
                print("Yes")
                return

    print("No")

    
if __name__ == '__main__':
    main()

Solution (Python):
a,b,c = map(int,input().split())
for i in range(a+1):
    for m in range(b+1):
        if (a - i)*(b - m) + i * m == c:
            print("Yes")
            exit()
print("No")

Solution (Python):
def solve():
    N, M, K = list(map(int, input().split(" ")))
    for i in range(N+1):
        for j in range(M+1):
            black = i*(M-j)+j*(N-i)
            if black == K:
                print("Yes")
                return
    print("No")

solve()

Solution (Python):
N,M,K = map(int,input().split())
if K ==0:
    print("Yes")
    exit()
for n in range(N):
    for m in range(M):
        if n*m+(N-n)*(M-m) == K:
            print("Yes")
            exit()
print("No")

Solution (Python):
N, M, K = map(int, input().split())
for i in range(N + 1):
    for j in range(M + 1):
        black = i * (M - j) + (N - i) * j
        
        if black == K:
            print("Yes")
            exit()
print("No")

Solution (Python):
import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache, reduce
from operator import xor
INF = float("inf")
sys.setrecursionlimit(10**7)


dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]


def inside(y: int, x: int, H: int, W: int) -> bool: return 0 <= y < H and 0 <= x < W


def main():
    N, M, K = map(int, input().split())
    for y in range(N + 1):
        for x in range(M + 1):
            a = y * M + x * N - y * x * 2
            if a == K:
                print("Yes")
                return
    print("No")


if __name__ == '__main__':
    main()

Solution (Python):
if __name__ == "__main__":
    N,M,K = map(int, input().split())
    for x in range(N + 1):
        for y in range(M + 1):
            res = x * M + y * N - x * y * 2
            if res == K:
                print ("Yes")
                exit()
    print ("No")

Solution (Python):
if __name__ == "__main__":
    N,M,K = map(int, input().split())
    for x in range(N + 1):
        for y in range(M + 1):
            res = x * M + y * N - x * y * 2
            if res == K:
                print ("Yes")
                exit()
    print ("No")