import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


// min x >= 0 s.t. l <= ((a x) mod m) <= r
// m > 0, a >= 0
long modRange(long m, long a, long l, long r) {
  chmax(l, 0L);
  chmin(r, m - 1);
  if (l > r) return -1;
  a %= m;
  if (a == 0) return (l > 0) ? -1 : 0;
  const k = (l + a - 1) / a;
  if (a * k <= r) return k;
  const y = modRange(a, m, a * k - r, a * k - l);
  return (y == -1) ? -1 : ((m * y + r) / a);
}


long solve(long A, long B, long T) {
  long G = gcd(A, B);
  if (G > 1) {
    return G * solve(A / G, B / G, (T + G - 1) / G);
  }
  long lo = T % A - 1, hi = A;
  for (; lo + 1 < hi; ) {
    const mid = (lo + hi) / 2;
    const x = modRange(A, B, T % A, mid);
    ((B * x / A <= T / A) ? hi : lo) = mid;
  }
  return T / A * A + hi;
}

void main() {
  try {
    for (; ; ) {
      const A = readLong();
      const B = readLong();
      const T = readLong();
      const ans = solve(A, B, T);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}