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

int main()
{
	int n, m, k;
	cin >> n >> m >> k;
	int a[n + 1][m + 1];
	int cnt = 0;
	int kx, ky;
	for(int i = 1;i <= n;i++)
	{
		for(int j = 1;j <= m;j++)
		{
			a[i][j] = ++cnt;
			if(a[i][j] == k)
			{
				kx = i;
				ky = j;
			}
		}
	}
	int ansx, ansy;
	ansx = kx - 1 + ky - 1 + 1;
	ansy = n - kx + ky - 1 + 1;
	cout << ansx << " " << ansy << endl;
	return 0;
}