#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>

using namespace std;
using ll = long long;

const ll mod = 1000000007;

ll powmod(ll a, ll b) {
    ll ret = 1;
    while (b) {
        if (b % 2 == 1) {
            ret = (ret * a) % mod;
        }
        a = (a * a) % mod;
        b /= 2;
    }
    return ret;
}

ll sum(ll a, ll r, ll n) {
    if (n == 1) {
        return a % mod;
    }

    ll x = sum(a, r, n / 2);
    ll ret = (x + powmod(r, n / 2) * x) % mod;
    if (n % 2 == 1) {
        ret = (a + r * ret) % mod;
    }
    return ret;
}

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

    ll B, C, D;
    cin >> B >> C >> D;

    B %= mod;
    C %= mod;
    cout << (B * sum(C, C, D)) % mod << endl;

    return 0;
}