#include<bits/stdc++.h>
using namespace std;
const int N = 10001;
int a[N][N];
vector<pair<int,int>> v(N);
int main(){
	cin.tie(0);
	cout.tie(0);
	int n, m, k;
	cin >> n >> m >> k;
	int f = 1;
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= m; j++){
			a[i][j] = f;
			f++;
		}
	}
	//È·¶¨ÐÐ 
	for(int j = 1; j <= n; j++) {
		for(int i = 1; i <= m; i++){
			v[a[i][j]].first = i+j-1;
		}
	}
	//ÁÐ 
	for(int j = 1; j <= n; j++) {
		int x = j;
		for(int i = m; i >= 1; i--){
			v[a[i][j]].second = x;
			x++;
		}
	}
	if(n == m){
		cout << v[k].first << " " << v[k].second;
	}else{
		cout << v[k].first << " " << v[k].second+1;
	} 
	return 0;
}