#include<bits/stdc++.h>
using namespace std;
pair<int,int>a[40005];
int main(){
	int n,m,k;
	cin>>n>>m>>k;
	int hang=1;
	int lie=n;
	for(int i=1;i<=n*m;i+=m){
		a[i].first=hang;
		a[i].second=lie;
		hang++;
		lie--; 
	}
	int f=0;
	if(k/m!=0) f=k/m+1;
	else f=k/m;
	f=(f-1)*m+1;
	//cout<<f<<endl;
	int q=k-f;
	cout<<a[f].first+q<<" "<<a[f].second+q<<endl; 
	return 0;
}