N,M,C=map(int,input().split())
used=[[False]*M]*N
dx,dy=[0,0,1,-1],[1,-1,0,0]
def dfs(n,y,x):
	if n == N * M-1:
		return y*M+x==C-1
	for i in range(4):
		nx,ny=dx[i]+x,dy[i]+y
		if nx<0 or ny<0 or nx>=M or ny>=N:
			continue
		used[ny][nx]=True
		if dfs(n+1,ny,nx):
			return True
		used[ny][nx]=False
	return False
print('YES' if dfs(1,(C-1)//M,(C-1)%M) else 'NO')