#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#ifdef APURBA
#include "DEBUG_TEMPLATE.h"
#else
#define HERE
#define debug(args...)
#endif
#define ALL(x) x.begin(),x.end()

const int oo=1e8;
const int N=1e6+7;
ll k,j,n;
int pos=-1;
int pos1=-1;
int pos2=-1;

int dp2(int );
int save1[N];
int save2[N];
int dp1(int n)
{
    if(n<=0)
            return 0;

    int &ret=save1[n];
    if(ret!=-1) return ret;
    ret=oo;
    if(pos1  == -1 or pos1 > n)
    {
        ret = n/j+(n>=k-1 ? (n-(k-1))/k+1 : 0);
    }
    else
    {
        ret = pos1/j+(pos1-(k-1))/k+1;
        ret+=min(dp1(n-pos1), dp2(n-pos1));
    }
    return ret;
}

int dp2(int n)
{
    if(n<=0)
        return 0;
    int &ret=save2[n];
    if(ret!=-1) return ret;
    ret=oo;
    if(pos2  == -1 or pos2 > n)
    {
        ret = n/k+(n>=j-1 ? (n-(j-1))/j+1 : 0);
    }
    else
    {
        ret = pos2/k+(pos2-(j-1))/j+1;
        ret+=min(dp1(n-pos2), dp2(n-pos2));
    }
    return ret;
}

int dp(int n)
{
    if(pos == -1)
    {
        return n/k+n/j;
    }
    int ret = pos/k+pos/j;
    debug(pos,k,j);
    debug(ret);
    ret+=min(dp1(n-pos),dp2(n-pos));
    return ret;
}

void TEST_CASES()
{
    cin>>k>>j>>n;
    if(j>k) swap(j,k);

    for(int i=1;i<=n;i++)
    {
        if(i%k == 0 and i %j == 0)
        {
            pos=i;
            break;
        }
    }

    for(int i=k-1;i<=n;i++)
    {
        if((i-(k-1))%k==0 and i % j == 0)
        {
            pos1=i;
            break;
        }
    }


    for(int i=j-1;i<=n;i++)
    {
        if(i%k==0 and (i-(j-1))%j==0)
        {
            pos2=i;
            break;
        }
    }
    memset(save1,-1,sizeof save1);
    memset(save2,-1,sizeof save2);
    cout<<dp(n)<<"\n";

}


/*
*/

int32_t main()
{
#ifndef APURBA
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    //freopen("input.txt","r",stdin);
    //freopen("out1.txt","w",stdout);
    int t=1;
    //cin>>t;
    while(t--)
    {
        TEST_CASES();
    }
    return 0;
}