void main(){
  import std.stdio, std.string, std.conv, std.algorithm;
  import std.bigint;

  long b, c, d; rd(b, c, d);

  const long mod=1_000_000_000+7;

  long pow(long a, long x){
    if(x==0) return cast(long)1;
    else if(x==1) return a%mod;
    else if(x&1) return (a%mod)*(pow(a, x-1)%mod)%mod;
    else return pow(((a%mod)*(a%mod))%mod, x/2);
  }

  long inv(long x){
    return pow(x, mod-2);
  }

  long ret=b%mod;
  if(c==1){
    ret=ret*(d%mod)%mod;
  }else{
    ret=ret*(c%mod)%mod;
    ret=ret*((pow(c, d)-1+mod)%mod)%mod;
    ret=ret*inv(c-1)%mod;
  }

  writeln(ret%mod);
}

/+
  1. B*C
  2. (B*C+B)*C
  3. ((B*C+B)*C+B)*C
  4. (((B*C+B)*C+B)*C+B)*C=B(C^4+C^3+C^2+C)

  C+C^2+...+C^D = C*(C^D-1)/(C-1)
+/

void rd(T...)(ref T x){
  import std.stdio, std.string, std.conv;
  auto l=readln.split;
  assert(l.length==x.length);
  foreach(i, ref e; x) e=l[i].to!(typeof(e));
}