#include <bits/stdc++.h>
using namespace std;

using int64 = long long;
using uint64 = unsigned long long;

const int64 MOD = 1e9 + 7;

int64 table[50];    // table[n]:=\sum_{i=1}^{2^n} c^{i}

int main()
{
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int64 B, C, D;
    cin >> B >> C >> D;

    B %= MOD;
    C %= MOD;

    int64 ans = 0, cum = 1, powC = C;
    int pos = 0;

    table[pos] = C;

    while (D > 0)
    {
        if (D & 1)
        {
            (ans += cum * table[pos]) %= MOD;
            (cum *= powC) %= MOD;
        }

        table[pos + 1] = (table[pos] + powC * table[pos]) % MOD; 
        (powC *= powC) %= MOD;
        pos++;
        D >>= 1;
    }

    (ans *= B) %= MOD;

    cout << ans << endl;

    return 0;
}