#include "bits/stdc++.h"

using namespace std;

using lint = int64_t;

template<typename T>
T egcd(T a, T b, T& x, T& y) {
    if (a == 0) {
        x = 0, y = 1;
        return b;
    }
    T p = b/a, g = egcd(b - p*a, a, y, x);
    x -= p * y;
    return g;
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int K, J, N; cin >> K >> J >> N;

    int x, y, g = egcd(K, J, x, y);
    // cerr << g << endl;
    if (K*J/g > N) {
        cout << N/K + N/J << '\n';
    } else {
        const int INF = INT_MAX/3;
        vector<int> dp(N + 1, INF);
        const int V = K*J/g;
		dp[V] = V/K + V/J;
		int ans = INF;
		for (int s = 1; s <= N; ++s) { 
			if (dp[s] == INF) continue;
			{
				bool ok = false;
				if (g == 1) {
					int a = x, b = y;

					if (a < 0){
						a += J;
						b -= K;
					}
					
					if (s + a*K - 1 <= N) {
						ok = true;
						dp[s + a*K - 1] = min(dp[s + a*K - 1], dp[s] + a - b);
					}
				}

				if (!ok || g != 1) {
					ans = min(ans, dp[s] + (N-s+1)/K + (N-s)/J);
				}
			}
			{
				bool ok = false;
				if (g == 1) {
					int a = y, b = x;

					if (a < 0){
						a += K;
						b -= J;
					}
					
					if (s + a*J - 1 <= N) {
						ok = true;
						dp[s + a*J - 1] = min(dp[s + a*J - 1], dp[s] + a - b);
					}
				}

				if (!ok || g != 1) {
					ans = min(ans, dp[s] + (N-s+1)/J + (N-s)/K);
				}
			}
		}
		cout << ans << '\n';
    }
}