Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

The following languages are only available languages for the problems from the contest

Unknown Language Round #1:

- ActiveTcl 8.5

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Table

time limit per test

2 secondsmemory limit per test

64 megabytesinput

standard inputoutput

standard outputThe integer numbers from 1 to *nm* was put into rectangular table having *n* rows and *m* columns. The numbers was put from left to right, from top to bottom, i.e. the first row contains integers 1, 2, ..., *m*, the second — *m* + 1, *m* + 2, ..., 2 * *m* and so on.

After it these numbers was written on the paper in another order: from top to bottom, from left to right. First, the numbers in the first column was written (from top to bottom) and so on.

Print the *k*-th number on the paper.

Input

The only line in the input contains three integer numbers *n*, *m* and *k* (1 ≤ *n*, *m* ≤ 20000, 1 ≤ *k* ≤ *nm*).

Output

Print the required number.

Examples

Input

3 4 11

Output

8

Input

20000 10000 200000000

Output

200000000

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/20/2019 21:41:46 (d3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|