/* -*- coding: utf-8 -*-
 *
 * 1350.cc:  No.1350 2019-6problem - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

/* typedef */

typedef long long ll;

/* global variables */

/* subroutines */

template <typename T>
T gcd(T m, T n) {  // m > 0, n > 0
  if (m < n) swap(m, n);
  while (n > 0) {
    T r = m % n;
    m = n;
    n = r;
  }
  return m;
}

/* main */

int main() {
  int a, b, k;
  scanf("%d%d%d", &a, &b, &k);

  int g = gcd<int>(a, b);
  ll l = (ll)a * b / g;
  int c = l / a + l / b - 1;
  //printf("l=%lld, c=%d\n", l, c);

  int r = k % c;
  if (r == 0) {
    printf("%lld\n", l * (k / c));
    return 0;
  }
  
  int i0 = 0, i1 = l / a;
  while (i0 + 1 < i1) {
    int i = (i0 + i1) / 2;
    int s = i + (ll)a * i / b;
    if (s >= r) i1 = i;
    else i0 = i;
  }
  //printf("i1=%d\n", i1);

  if (i1 + (ll)a * i1 / b == r) {
    printf("%lld\n", l * (k / c) + (ll)a * i1);
    return 0;
  }

  int j0 = 0, j1 = l / b;
  while (j0 + 1 < j1) {
    int j = (j0 + j1) / 2;
    int s = j + (ll)b * j / a;
    if (s >= r) j1 = j;
    else j0 = j;
  }
  //printf("j1=%d\n", j1);

  printf("%lld\n", l * (k / c) + (ll)b * j1);
  return 0;
}