#include <bits/stdc++.h>
using namespace std;

int n, m, k, x, y = 1, x1, y1;

int a[32769][32769];

int main()
{
	cin >> n >> m >> k;
	int cur = 1;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			a[i][j] = cur;
			cur++;
		}
	}
	bool flag = 0;
	x = n;
	cur = 1;
	while (1)
	{
		
		int x0 = x;
		while (1){
		
			if (a[x0][y] == k)
			{
				y1 = cur;
				flag = 1;
			}
			if (x0 != n) x0++;
			y++;
	}
		if (x != 1) x--;
		y = 1;
		cur++;
		if (flag) break;
	}
	flag = 0;
	y = m;
	cur = 1;
	x = 1;
	while (1)
	{
		int y0 = y;
		while (1)
		{
			if (a[x][y] == k)
			{
				x1 = cur;
				flag = 1;
			}
			if (y0 != n) y0--;
			x++;
	}
		if (y != 1) y--;
		x = 1;
		cur++;
		if (flag) break;
	}
	cout << x1 << " " << y1 << endl;
	return 0;
}