#include <bits/stdc++.h>
using namespace std;
int a[5010][5010];
int main()
{
	int n, m, k;
	cin >> m >> n >> k;
	a[1][m] = 1;
	for (int i = 1; i <= n + m - 1; i ++)
	{
		for (int j = 1; j <= n + m - 1; j ++)
		{
			if ((j - 1 >= 1 && i - 1 >= 1) && a[i - 1][j - 1] != 0)
			{
				a[i][j] = a[i - 1][j - 1] + 1;
			}
			else if ((j + 1 <= n + m - 1 && i - 1 >= 1) && a[i - 1][j + 1] != 0)
			{
				a[i][j] = a[i - 1][j + 1] + n;
			}
			if (a[i][j] == k)
			{
				cout << i << " " << j << endl;
				return 0;
			}
		}
	}
	return 0;
}