#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()
#define pb push_back

int solve(int n, int k, int j) {
    int ans = 0;
    int a = k, b = j;
    for (int i = 1; i <= n; ++i) {
        --a, --b;
        if (a == 0 && b == 0) {
            if (k - ((n - i) % k) < j - ((n - i) % j)) {
                a = k;
                b = j - 1;
            }
            else {
                a = k - 1;
                b = j;
            }
            ans += 2;
        }
        else if (a == 0) {
            a = k;
            ++ans;
        }
        else if (b == 0) {
            b = j;
            ++ans;
        }
    }
    return ans;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, k, j;
    cin >> k >> j >> n;
    cout << min(solve(n, k, j), solve(n, j, k)) << "\n";
}