#include<bits/stdc++.h>
using namespace std;
struct node{
	long long x;
	long long y;
	long long num;
};


signed main(){
	long long n,m,k;
	scanf("%lld%lld%lld",&n,&m,&k);
	vector<node> hangs;
	long long x=1,y=n;
	for(long long i=1;i<=(n*m)-m+1;i+=m){
		hangs.push_back({x,y,i});
		x++;
		y--;
	}
	hangs.push_back({114514,1919810,1145141919810});
	for(long long i=0;i<hangs.size();i++){
		if(hangs[i].num<=k&&hangs[i+1].num>k){
			k-=hangs[i].num;
			cout<<hangs[i].x+k<<' '<<hangs[i].y+k<<endl;
			return 0;
		}
	}
	cout<<endl;
	return 0;
}
//32768 32768 1073741824