#include <bits/stdc++.h>
using namespace std;
int n, m, k, cnt, a[1005][1005], b[2005][2005];
int main()
{
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			a[i][j] = ++cnt;
	int jsq = 1, maxi = n, mini = 1, maxj = n, minj = 1;
	while (jsq <= m)
	{
		int x = n, y = jsq;
		for (int i = maxi, j = minj; i >= mini; i--, j++)
		{
			b[i][j] = a[x][y];
			x--;
		}
		maxi++, mini++;
		maxj++, minj++;
		jsq++;
	}
	for (int i = 1; i <= n + m - 1; i++)
		for (int j = 1; j <= n + m - 1; j++)
			if (b[i][j] == k) cout << i << " " << j << endl;
	return 0;
}