import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.math;

immutable long mod = 1000000007;

void main() {
    long b, c, d;
    scan(b, c, d);
    b %= mod;
    c %= mod;

    long ans;

    if (c == 1) {
        d %= mod;
        ans = b * d % mod;
        writeln(ans);
        return;
    }

    ans = b * ((powmod(c, d) + mod - 1) % mod) % mod;
    ans *= powmod(c - 1, mod - 2);
    ans %= mod;
    ans *= c;
    ans %= mod;

    writeln(ans);
}

long powmod(long x, long y) {
    return y > 0 ? powmod(x, y>>1)^^2 % mod * x^^(y&1) % mod : 1L;
}


void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}