#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 findMeet = [&k, &j, &n](int cnt1, int cnt2)
    {
        for (int i = 0; i < n + 10; ++i)
        {
            ++cnt1;
            ++cnt2;
            if (cnt1 == k && cnt2 == j)
                return i;
            cnt1 %= k;
            cnt2 %= j;
        }
        return n + 10;
    };
    if (findMeet(0, 1) < findMeet(1, 0))
        swap(k, j);
    int res = 0;
    int cnt1 = 0, cnt2 = 0;
    for (int i = 0; i < n; ++i)
    {
        ++cnt1;
        ++cnt2;
        if (cnt1 == j && cnt2 == k)
        {
            res += 2;
            cnt1 = 1;
            cnt2 = 0;
        }
        if (cnt1 == j)
        {
            ++res;
            cnt1 = 0;
        }
        if (cnt2 == k)
        {
            ++res;
            cnt2 = 0;
        }
    }
    cout << res << '\n';
    return 0;
}