#include <vector>
#include <queue>
#include <list>
#include <iostream>
#include <array>
#include <string>
#include <numeric>
#include <algorithm>
#include <cmath>

using namespace std;

using ll = long long;

int main()
{
    int k, j, n;
    cin >> k >> j >> n;
    auto findArr = [&n](int k, int j)
    {
        vector<int> res;
        int cnt0 = 0, cnt1 = 1;
        for (int i = 0; i < n + 5; ++i)
        {
            res.push_back((i == 0 ? 0 : res.back()));
            ++cnt0;
            ++cnt1;
            if (cnt0 == k && cnt1 == j)
            {
                res.pop_back();
                return res;
            }
            res[i] += cnt0 / k + cnt1 / j;
            cnt0 %= k;
            cnt1 %= j;
        }
        return res;
    };
    vector<int> arr1 = findArr(k, j), arr2 = findArr(j, k);
    vector<int> dp(n);
    dp[0] = 0;
    for (int i = 1; i <= n; ++i)
    {
        if (i > arr1.size())
            dp[i] = dp[i - arr1.size() - 1] + arr1.back() + 2;
        else
            dp[i] = arr1[i - 1];
        if (i > arr2.size())
            dp[i] = min(dp[i], dp[i - arr2.size() - 1] + arr2.back() + 2);
        else
            dp[i] = min(dp[i], arr2[i - 1]);
    }
    int cnt1 = 0, cnt2 = 0, res = 0;
    for (int i = 1; i <= n; ++i)
    {
        ++cnt1;
        ++cnt2;
        res += cnt1 / k + cnt2 / j;
        if (cnt1 == k && cnt2 == j)
        {
            res += dp[n - i];
            break;
        }
        cnt1 %= k;
        cnt2 %= j;
    }
    cout << res;
    return 0;
}