#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 2147483600
#define MOD 1000000007

// x^n mod p
long mod_pow(long x, long n, long p=MOD){
  long res=1;
  x %= p;
  while(n>0){
    if(n&1) res=res*x%p;
    x=x*x%p;
    n>>=1;
  }
  return res;
}
long mod_inv(long x, long p=MOD){ return mod_pow(x%p, p-2, p); }
long fact(long n, long p=MOD){
  long ret=1;
  while(n>1) ret=ret*n%p, n--;
  return ret;
}
long comb(long n, long k, long p=MOD){ return fact(n,p)*mod_inv(fact(k,p),p)%p*mod_inv(fact(n-k,p),p)%p;}

int main(){
  long n,k,d;
  cin>>n>>k>>d;
  long m = (n-1)/(k-1);
  long l = n - m*(k-1);

  if(d==1){
    cout << l << endl;
    return 0;
  }

  long c = comb(l+m-2, l-2);
  long ans = c%MOD;
  long dd = d;
  repl(p,1,m+1){
    c *= mod_inv(l+m-p-1)*(m-p+1)%MOD; c%=MOD;
    ans += dd*c%MOD; ans %=MOD;
    dd = dd*d %MOD;
  }

  cout << ans * l %MOD << endl;

  return 0;
}