#include <cstdio>

 #include <iostream>

 #include <cstring>

 #include <algorithm>

 #define maxn 1000100

 #define ll long long

 using namespace std;

 const int inf=<<;

 ll n,m,k;

 ll a[maxn];

 ll dp[][];

 bool ok(ll x)

 {

     ll cnt=;

     for(int i=; i<=n; i++)

     {

        cnt+=min(x/(ll)i,m);

     }

     if(cnt>=k) return true;

     return false;

 }

 int main()

 {

     cin>>n>>m>>k;

     ll l=,r=n*m;

     ll ans;

     while(l<=r)

     {

         ll mid=(l+r)>>;

         if(ok(mid))

         {

            ans=mid;

            r=mid-;

         }

         else l=mid+;

     }

     cout<<ans<<endl;

     return ;

 }