output_description: Print the minimum number of operations needed.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      H
      W
      N
attempt: d = max(int(input()), int(input()))
  print((int(input()) + (d - 1)) // d)
  
problem_description: Statement
  
  We have a grid with H rows and W columns, where all the squares are initially
  white.
  
  You will perform some number of painting operations on the grid. In one
  operation, you can do one of the following two actions:
  
    * Choose one row, then paint all the squares in that row black.
    * Choose one column, then paint all the squares in that column black.
  
  At least how many operations do you need in order to have N or more black
  squares in the grid? It is guaranteed that, under the conditions in
  Constraints, having N or more black squares is always possible by performing
  some number of operations.
samples: [{"input": "3\n    7\n    10", "output": "2\n    \n\nYou can have 14 black squares in the grid by performing the \"row\" operation\ntwice, on different rows.\n\n* * *"}, {"input": "14\n    12\n    112", "output": "8\n    \n\n* * *"}, {"input": "2\n    100\n    200", "output": "2"}]