output_description: If Takahashi can have exactly K black squares in the grid, print `Yes`;
  otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N M K
attempt: n,m,k= input().split()
  
  n = int(n)
  m = int(m)
  k = int(k)
  
  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")
       
problem_description: 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.
samples: [{"input": "2 2 2", "output": "Yes\n    \n\nPress the buttons in the order of the first row, the first column.\n\n* * *"}, {"input": "2 2 1", "output": "No\n    \n\n* * *"}, {"input": "3 5 8", "output": "Yes\n    \n\nPress the buttons in the order of the first column, third column, second row,\nfifth column.\n\n* * *"}, {"input": "7 9 20", "output": "No"}]