#include<bits/stdc++.h>
using namespace std;
deque<pair<int,int> >q;
int main(){
	int n,m,k;
	cin>>n>>m>>k;
	int h=n+m-1;
	int x=ceil(k*1.0/m),y=k%m;
	if(y==0) y=m;
	int sum=n+y*2-1;
	for(int i=1;i<sum;i++){
		q.push_back({i,sum-i});
	}
	int t=sum-1;
	while(1){
		if(t!=n){
			t-=2;
			q.pop_front();
			q.pop_back();
		}else break;
	}
	x--;
	while(x--){
		q.pop_front();
	}
	cout<<q.front().first<<" "<<q.front().second;
	return 0;
}