/* Author:zeke pass System Test! GET AC!! */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using ll = long long; using ld = long double; using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define all(x) (x).begin(), (x).end() #define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var)) #define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var)) #define Mp(a, b) make_pair((a), (b)) #define F first #define S second #define Icin(s) \ ll(s); \ cin >> (s); #define Scin(s) \ ll(s); \ cin >> (s); template bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } typedef pair P; typedef vector V; typedef vector VV; typedef vector

VP; ll mod = 1e9 + 7; ll MOD = 1e9 + 7; ll INF = 1e18; int main() { cin.tie(0); ios::sync_with_stdio(false); ll n,d,K; cin>>n>>d>>K; VV dp(n+1,V(K+1)); dp[0][0]=1; rep(i,n){ for(int j=K;j>=0;j--){ for(int k=d;k>=1;k--){ if(j+k>K){ continue; } dp[i+1][k+j]+=dp[i][j]; dp[i+1][k+j]%=MOD; } } } /* rep(i,n+1){ rep(j,K+1){ cout<