#include #define F first #define S second #define MP make_pair #define pb push_back #define all(a) a.begin(), a.end() #define lcm(a, b) (a)/__gcd((a),(b))*(b) #define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0) #define endl '\n' using namespace std; typedef long long LL; typedef pair P; typedef pair LP; static const int INF = INT_MAX; static const LL LINF = LLONG_MAX; static const int MIN = INT_MIN; static const LL LMIN = LLONG_MIN; static const int MOD = 1000000007; static const int SIZE = 200005; const int dx[] = {0, -1, 1, 0}; const int dy[] = {-1, 0, 0, 1}; vector Div(int n) { vector ret; for(int i = 1; i * i <= n; ++i) { if(n % i == 0) { ret.pb(i); if(i * i != n) ret.pb(n / i); } } sort(all(ret)); return ret; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, d, k; cin >> n >> d >> k; LL dp[n + 1][k + 1] = {}; dp[0][0] = 1; for(int i = 1; i <= d; ++i) { dp[1][i] = 1; } for(int i = 2; i <= n; ++i) { for(int j = 1; j <= k; ++j) { dp[i][j] = dp[i - 1][j - 1]; dp[i][j] += dp[i][j - 1]; if(j - d - 1 > 0) { dp[i][j] -= dp[i - 1][j - d - 1]; } dp[i][j] %= MOD; } } /* for(int i = 1; i <= n; ++i) { for(int j = 1; j <= k; ++j) { cout << dp[i][j] << " "; } cout << endl; } */ cout << dp[n][k] << endl; return 0; }