#include using namespace std; using Int = long long; typedef pair P; typedef priority_queue Pr; typedef vector V; typedef vector

Vp; typedef map MP; const int mod = 1000000007; const Int INF = 1145141919810893931; #define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i)) #define END cout< inline bool cmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool cmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template struct ModInt { static const int Mod = MOD; unsigned x; ModInt() : x(0) {} ModInt(signed sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; } ModInt(signed long long sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; } int get() const { return (int)x; } ModInt &operator+=(ModInt that) { if((x += that.x) >= MOD) x -= MOD; return *this; } ModInt &operator-=(ModInt that) { if((x += MOD - that.x) >= MOD) x -= MOD; return *this; } ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; } ModInt &operator/=(ModInt that) { return *this *= that.inverse(); } ModInt operator+(ModInt that) const { return ModInt(*this) += that; } ModInt operator-(ModInt that) const { return ModInt(*this) -= that; } ModInt operator*(ModInt that) const { return ModInt(*this) *= that; } ModInt operator/(ModInt that) const { return ModInt(*this) /= that; } ModInt inverse() const { signed a = x, b = MOD, u = 1, v = 0; while(b) { signed t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); } if(u < 0) u += Mod; ModInt res; res.x = (unsigned)u; return res; } bool operator==(ModInt that) const { return x == that.x; } bool operator!=(ModInt that) const { return x != that.x; } ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; } }; template ModInt operator^(ModInt a, unsigned long long k) { ModInt r = 1; while(k) { if(k & 1) r *= a; a *= a; k >>= 1; } return r; } typedef ModInt mint; vector fact, factinv; void COMinit(int N) { N = min(N, mint::Mod - 1); fact.resize(N + 1); factinv.resize(N + 1); fact[0] = 1; rer(i, 1, N) fact[i] = fact[i - 1] * i; factinv[N] = fact[N].inverse(); for(int i = N; i >= 1; i --) factinv[i - 1] = factinv[i] * i; } mint C(int n, int r) { if(n >= mint::Mod) return C(n % mint::Mod, r % mint::Mod) * C(n / mint::Mod, r / mint::Mod); return r > n ? 0 : fact[n] * factinv[n - r] * factinv[r]; } mint dp[101][20001]; int main(){ cin.tie(0); ios::sync_with_stdio(false); int n,s,k; cin>>n>>s>>k; COMinit(40000); dp[0][0]=1; for (int i = 1; i <= n; i++){ for (int j = 0; j <= s; j++){ if(j>=i)dp[i][j]=dp[i-1][j]+dp[i][j-i]; else dp[i][j]=dp[i-1][j]; } } cout<