#include <bits/stdc++.h>
using namespace std;
long long int myfind(long long int n, long long int m, long long int num) {
  long long int i, j, ans = 0;
  for (i = 1; i <= n; i++) {
    j = min(m * i, num);
    ans += j / i;
  }
  return ans;
}
int main() {
  long long int n, m, k;
  scanf("%lld%lld%lld", &n, &m, &k);
  long long int h, l, mid, ans;
  h = 250000000001;
  l = 1;
  while (l <= h) {
    mid = ((h - l) >> 1) + l;
    if (myfind(n, m, mid) >= k) {
      ans = mid;
      h = mid - 1;
    } else {
      l = mid + 1;
    }
  }
  printf("%lld\n", ans);
  return 0;
}
