#include<bits/stdc++.h>

using namespace std;

#define sz(x) (int)(x.size())
#define pb(x) push_back(x) 
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int Mod1 = 998244353;
const int Mod2 = 1e9 + 7;

int n, m, k, a[32770][32770][3], cnt = 0;

int main(){
	scanf("%d%d%d", &n, &m, &k);
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			a[i][j][1] = i;
			a[i][j][2] = j;
			a[i][j][3] = ++cnt;
		}
	}
	int nn = n - 1, nm = m - 1;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			if(a[i][j][3] == k){
				int xx, yy = (k + (m - 1)) / m;
				if(k % m == 0){
					xx = m;
				} else{
					xx = k % m;
				}
				printf("%d %d", a[i][j][1] + (xx - 1), a[i][j][2] + (n - yy));
				return 0;
			}
		}
	}
	return 0;
}