#include<bits/stdc++.h>
using namespace std;
struct node
{
	int col;
	int lin;
}a[105][105];
int main()
{
	long long n,m,k;
	cin>>n>>m>>k;
	int startcol=n;
	int startlin=1;
	int nowcol=n;
	int nowlin=1;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			a[i][j].col=nowcol;
			a[i][j].lin=nowlin;
			nowcol++;
			nowlin++;
		}
		int ma=i;
		nowcol=startcol-ma;
		nowlin=startlin+ma;
	}
	int finalcol=0;
	int finallin=0;
	if(k%m==0)
	{
		finallin=k/m;
		finalcol=m;
	}
	else
	{
		finallin=k/m+1;
		finalcol=k%m;
	}
	cout<<a[finallin][finalcol].lin<<" "<<a[finallin][finalcol].col;
	return 0;
}