#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;

int main() {
    ll v, t, p;
    cin >> v >> t >> p;

    ll ok = 0, ng = 3e18;
    while (ng - ok > 1) {
        ll mid = (ng + ok) / 2;

        mid -= (mid - 2) / t + 1;
        if (mid <= v * (p + 1))ok = (ng + ok) / 2;
        else ng = (ng + ok) / 2;
    }

    cout << ok << endl;
    return 0;
}