{"raw_statement":[{"iden":"problem statement","content":"We have a grid with $H$ rows and $W$ columns, where all the squares are initially white.\nYou will perform some number of painting operations on the grid. In one operation, you can do one of the following two actions:\n\n*   Choose one row, then paint all the squares in that row black.\n*   Choose one column, then paint all the squares in that column black.\n\nAt 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."},{"iden":"constraints","content":"*   $1 \\leq H \\leq 100$\n*   $1 \\leq W \\leq 100$\n*   $1 \\leq N \\leq H \\times W$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$H$\n$W$\n$N$"},{"iden":"sample input 1","content":"3\n7\n10"},{"iden":"sample output 1","content":"2\n\nYou can have $14$ black squares in the grid by performing the \"row\" operation twice, on different rows."},{"iden":"sample input 2","content":"14\n12\n112"},{"iden":"sample output 2","content":"8"},{"iden":"sample input 3","content":"2\n100\n200"},{"iden":"sample output 3","content":"2"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}