CodeForces 976B Lara Croft and the New Game

Description：

You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me lift the veil of secrecy.

Lara is going to explore yet another dangerous dungeon. Game designers decided to use good old 2D environment. The dungeon can be represented as a rectangle matrix of n rows and m columns. Cell (x, y) is the cell in the x-th row in the y-th column. Lara can move between the neighbouring by side cells in all four directions.

Moreover, she has even chosen the path for herself to avoid all the traps. She enters the dungeon in cell (1, 1), that is top left corner of the matrix. Then she goes down all the way to cell (n, 1) — the bottom left corner. Then she starts moving in the snake fashion — all the way to the right, one cell up, then to the left to the cell in 2-nd column, one cell up. She moves until she runs out of non-visited cells. n and m given are such that she always end up in cell (1, 2).

Lara has already moved to a neighbouring cell k times. Can you determine her current position?

Input

The only line contains three integers n, m and k (2 ≤ n, m ≤ 10⁹, n is always even, 0 ≤ k < n·m). Note that k doesn't fit into 32-bit integer type!

Output

Print the cell (the row and the column where the cell is situated) where Lara ends up after she moves k times.

Examples

Input

Copy

4 3 0

Output

Copy

1 1

Input

Copy

4 3 11

Output

Copy

1 2

Input

Copy

4 3 7

Output

Copy

3 2

Note

Here is her path on matrix 4 by 3:

题目大意：

给定一个n x m的地图， 输出走k部后的坐标（初始坐标为1， 1） 移动方式如上图所示（在步数足够的情况下先向下走到头， 再向右走到头， 向上一格， 向左走到头， 向上一格， 向右。。。往复循环）每个格子只能走一次。

解题思路：

公式题 ， 直接上代码。

代码：

#include <iostream>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <utility>
#include <string>
#include <cmath>
#include <vector>
#include <bitset>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int dir[9][2] = { 0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1, 0, 0 };
const int inf = 0x3f3f3f;
const ll ll_inf = (ll) 1e15;
const double pi = acos(-1.0);
const int mod = (ll) 1e9 + 7;
const int Max = (int) 1e3 + 51;
const ld eps = 1e-10;

/*tools:
*ios::sync_with_stdio(false);
*freopen("input.txt", "r", stdin);
*/

ll n, m, k;

int main() {
    scanf("%lld %lld %lld", &n, &m, &k);
    if (k == 0) printf("1 1\n");
    else if (n == 1) {
        printf("%lld 1\n", min(n, k));
    }
    else if (m == 1) {
        printf("1 %lld\n", min(m, k));
    }
    else if (k < n) {
        printf("%lld 1\n", 1 + k);
    }
    else {
        m -= 1;
        k -= n;

        if (((k / m) % 2) == 0) printf("%lld %lld\n", n - (k / m), k % m + 2);
        else printf("%lld %lld\n", n - (k / m), m - (k % m) + 1);
    }
    return 0;
}