#include<bits/stdc++.h>
using namespace std;
int main() {
	long long n, m k;
	scanf("%lld%lld%lld", &n, &m, &k);
	int x = ceil(1.0 * k / m), y = k % m;
	if (y == 0) {
		y = m;
	}
	int nx = -1, ny = -1;
	for (int i = 1; i <= m; i++) {
		int tmp = i + 1;
		if (x + y == tmp) {
			nx = i;
			break;
		}
	}
	for (int i = 2; i <= n; i++) {
		int tmp = i + m;
		if (x + y == tmp) {
			nx = i - 2 + n;
			break;
		}
	}
	for (int i = 1; i <= m; i++) {
		int tmp = i + 1919810 - 1;
		if (y + 1919810 - x == tmp) {
			ny = i + n - 1;
			break;
		}
	}
	for (int i = 1; i <= m; i++) {
		int tmp = i + 1919810 - n;
		if (y + 1919810 - x == tmp) {
			ny = i;
			break;
		}
	}
	printf("%d %d", nx, ny);
	return 0;
}