#include<bits/stdc++.h>
using namespace std;
pair<int,int> a[32769];
int main()
{
	int n,m,k;
	cin>>n>>m>>k;
	int i1=1;
	int s=m;
	int s2=0;
    while(i1!=1+(n)*m) 
    {
    	s2++;
		a[i1].first=s2;
    	a[i1].second=s;
    	s--;
    	if(k==i1)
		{
			cout<<s2<<' '<<s+2<<endl;
			return 0;
		} 
		i1+=m;
	}
	int w=k%m;
	if(w==0) w=m;
	int w1=a[k-w+1].first+w-1;
	int w2=a[k-w+1].second+w-1;
	cout<<w1<<' '<<w2;
    return 0;
}