#include using namespace std; using i64 = long long; const i64 MOD = 1e9 + 7; const i64 INF = i64(1e18) + 7; template bool chmin(T& x, T y){ if(x > y){ x = y; return true; } return false; } template bool chmax(T& x, T y){ if(x < y){ x = y; return true; } return false; } template struct ModInt{ i64 p; ModInt() : p(0){} ModInt(i64 x){p = x >= 0 ? x % mod : x + (-x + mod - 1) / mod * mod;} ModInt& operator+=(const ModInt& y){p = p + *y - ((p + *y) >= mod ? mod : 0); return *this;} ModInt& operator-=(const ModInt& y){p = p - *y + (p - *y < 0 ? mod : 0); return *this;} ModInt& operator*=(const ModInt& y){p = (p * *y) % mod; return *this;} ModInt& operator%=(const ModInt& y){if(y)p %= *y; return *this;} ModInt operator+(const ModInt& y) const{ModInt x = *this; return x += y;} ModInt operator-(const ModInt& y) const{ModInt x = *this; return x -= y;} ModInt operator*(const ModInt& y) const{ModInt x = *this; return x *= y;} ModInt operator%(const ModInt& y) const{ModInt x = *this; return x %= y;} friend ostream& operator<<(ostream& stream, const ModInt& x){ stream << *x; return stream; } friend ostream& operator>>(ostream& stream, const ModInt& x){ stream >> *x; return stream; } ModInt& operator++(){p = (p + 1) % mod; return *this;} ModInt& operator--(){p = (p - 1 + mod) % mod; return *this;} bool operator==(const ModInt& y) const{return p == *y;} bool operator!=(const ModInt& y) const{return p != *y;} const i64& operator*() const{return p;} i64& operator*(){return p;} }; using mint = ModInt<>; template struct Matrix{ int h, w; vector v; Matrix() : h(1), w(1), v(1, 1){} Matrix(int n){*this = makeUnit(n);} Matrix(int h, int w) : h(h), w(w), v(h * w, 0){} Matrix(vector> v_) : h(v_.size()), w(v_[0].size()), v(h * w){ for(int i = 0; i < h; ++i) for(int j = 0; j < w; ++j) v[i * w + j] = v_[i][j]; } static Matrix makeUnit(int n){ Matrix mat(n, n); for(int i = 0; i < n; ++i) mat.at(i, i) = 1; return mat; } T& at(int i, int j){ assert(0 <= i && i <= h && 0 <= j && j < w); return v[i * w + j]; }; Matrix pow(i64 x){ assert(h == w); auto mat = x & 1 ? *this : makeUnit(h); auto u = *this; while(u = u * u, x >>= 1) if(x & 1) mat *= u; return mat; } Matrix& operator+=(const Matrix& mat){ assert(h == mat.h && w == mat.w); for(int i = 0; i < h * w; ++i) v[i] += mat.v[i]; return *this; } Matrix& operator-=(const Matrix& mat){ assert(h == mat.h && w == mat.w); for(int i = 0; i < h * w; ++i) v[i] -= mat.v[i]; return *this; } Matrix& operator%=(const T mod){ for(int i = 0; i < h * w; ++i) v[i] %= mod; return *this; } Matrix operator*(const Matrix& mat){ assert(w == mat.h); Matrix ret(h, mat.w); for(int i = 0; i < h; ++i) for(int k = 0; k < w; ++k) for(int j = 0; j < mat.w; ++j) ret.v[i * mat.w + j] += v[i * w + k] * mat.v[k * mat.w + j]; return ret; } Matrix operator+(const Matrix& mat){return Matrix(*this) += mat;} Matrix operator-(const Matrix& mat){return Matrix(*this) -= mat;} Matrix operator%(const T mod){return Matrix(*this) %= mod;} Matrix& operator*=(const Matrix& mat){return *this = *this * mat;} }; signed main(){ int n, d, k; cin >> n >> d >> k; Matrix mat(k + 1, k + 1); for(int i = 0; i <= k; ++i) for(int j = i + 1; i + d >= j && j <= k; ++j) mat.at(i, j) = 1; mat = mat.pow(n); cout << mat.at(0, k) << endl; return 0; }