class INPUT:
  def __init__(self):
    self._l=open(0).read().split()
    self._length=len(self._l)
    self._index=0
    return

  def stream(self,k=1,f=int,f2=False):
    assert(-1<k)
    if self._length==self._index or self._length-self._index<k:
      raise Exception("There is no input!")
    elif f!=str:
      if k==0:
        ret=list(map(f,self._l[self._index:]))
        self._index=self._length
        return ret
      if k==1 and not f2:
        ret=f(self._l[self._index])
        self._index+=1
        return ret
      if k==1 and f2:
        ret=[f(self._l[self._index])]
        self._index+=1
        return ret
      ret=[]
      for _ in [0]*k:
        ret.append(f(self._l[self._index]))
        self._index+=1
      return ret
    else:
      if k==0:
        ret=list(self._l[self._index:])
        self._index=self._length
        return ret
      if k==1 and not f2:
        ret=self._l[self._index]
        self._index+=1
        return ret
      if k==1 and f2:
        ret=[self._l[self._index]]
        self._index+=1
        return ret
      ret=[]
      for _ in [0]*k:
        ret.append(self._l[self._index])
        self._index+=1
      return ret
pin=INPUT().stream

#pin(number[default:1],f[default:int],f2[default:False])
#if number==0 -> return left all
#listを変数で受け取るとき、必ずlistをTrueにすること。


def matrix_mul(A,B,mod):
  C=[[0]*len(B)for _ in[0]*len(A)]
  for i in range(len(A)):
    for k in range(len(B)):
      for j in range(len(B[0])):
        C[i][j]=(C[i][j]+A[i][k]*B[k][j])%mod
  return C

def matrix_exp(X,n,mod):
  Y=[[0]*len(X)for _ in[0]*len(X)]
  for i in range(len(X)):
    Y[i][i]=1
  while n>0:
    if n&1:
      Y=matrix_mul(Y,X,mod)
    X=matrix_mul(X,X,mod)
    n>>=1
  return Y

def calculate_nth(mod,n,A,C):
  A=matrix_exp(A,n,mod)
  res=matrix_mul(A,[[1],[0],[C],[0]],mod)
  return res[2][0]



def main():
  mod=10**9+7
  C,N,M=pin(3)
  A=[[1,0,0,1],[0,1,C-1,C-2],[C,0,0,0],[0,C,0,0]]
  ans=calculate_nth(mod,N,A,C)
  B=pow(pow(C,mod-2,mod),N+1,mod)
  # A にいる確率
  a=ans*B%mod
  # A にいない確率
  b=(1-a)%mod
  # M台がAに1台もいない確率
  c=pow(b,M,mod)
  # 余事象
  d=(1-c)%mod
  print(d)
  return

main()