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.
n,m,k = map(int,input().split())
s = []
for i in range(n//2+1):
    for j in range(m//2+1):
        s.append(i*j)
        s.append(n*m-i*j)
if k in s:
    print("Yes")
else:
    print("No")
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")