#include<bits/stdc++.h>
using namespace std;
long long n,m,k;
int main(){
	scanf("%lld %lld %lld",&n,&m,&k);
	long long a[n+1][m+1],sum=0,x[n+1][m+1],y[n+1][m+1];
	for(long long i=1;i<=n;i++){
		for(long long j=1;j<=m;j++){
			sum++;
			a[i][j]=sum;
			if(sum%m==1){
				y[i][j]=i;
				x[i][j]=n-i+1;
			}
			else{
				y[i][j]=y[i][j-1]+1;
				x[i][j]=x[i][j-1]+1;
			}
			if(sum==k){
				printf("%lld %lld",y[i][j],x[i][j]);
				return 0;
			}
		}
	}
}