#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
long long a[N + 1][N + 1];
long long b[2 * N][2 * N];
int main()
{
	int n, m;
	long long k;
	cin >> n >> m >> k;
	long long shu = 1;
	for(int i = 1; i <= n; i ++)
	{
		for(int j = 1; j <= m; j ++)
		{
			a[i][j] = shu;
			shu ++;
		}
	}
	for(int x = 1; x <= n; x ++)
	{
		int i2 = x, j2 = n - x + 1;
		for(int y = 1; y <= m; y ++)
		{
//			cout << "i1: " << x << " j1: " << y << " i2: " << i2 << " j2: " << j2 << " a[x][y]: " << a[x][y]<< endl;
			b[i2][j2] = a[x][y];
			i2 ++;
			j2 ++;
		}
	}
	for(int i = 1; i <= n + m - 1; i ++)
	{
		for(int j = 1; j <= n + m - 1; j ++)
		{
//			cout << setw(5)<< b[i][j] << " ";
			if(b[i][j] == k)
			{
				cout << i << " " << j << endl;
				return 0;
//				cout << "|" << i << " " << j << "| ";
			}
		}
//		cout << endl;
	}
	return 0;
}