#include using namespace std; #include using namespace atcoder; //using mint = static_modint<998244353>; using mint = static_modint<1000000007>; ostream &operator<<(ostream &o,const mint &m){cout<; using vl = vector; template using ve = vector; template using vv = vector>; template using vvv = vector>; #define rep(i,n) for(ll i=0;i<(ll)(n);++i) #define reps(i,s,n) for(ll i=(s);i<(ll)(n);++i) #define rep1(i,n) for(ll i=1;i<=(ll)(n);++i) #define fi first #define se second #define pb push_back #define eb emplace_back #define be(v) (v).begin(),(v).end() const long long INF = 1e18; #ifdef DEBUG #include random_device rd; mt19937 gen(rd()); ll random(ll l,ll h){ uniform_int_distribution dist(l,h); return dist(gen); } #endif ll N,M,D1,D2; void input(){ cin>>N>>M>>D1>>D2; } #ifdef DEBUG void showall(){ show(N,M,D1,D2); } #endif const ll MOD=1000000007; void fmod(vl &f){ for(auto &e:f){ if(e >= MOD) e %= MOD; } } ll logic(){ vl f(M+1,1); f.at(0)=0; vl g(D2+1,1); rep(i,D1)g.at(i)=0; int n=N-1; while(n){ if(n & 1){ f = convolution_ll(f,g); ll fsz = f.size(); if(fsz > M+1) f.resize(M+1); fmod(f); #ifdef DEBUG show("n fsz sz",n,fsz,f.size()); rep(i,f.size())if(f.at(i)>0)cout< M+1) g.resize(M+1); fmod(g); #ifdef DEBUG show("n gsz sz",n,gsz,g.size()); rep(i,g.size())if(g.at(i)>0)cout<>= 1; } #ifdef DEBUG show("g",g); show("f",f); #endif mint ans=0; rep(i,min((ll)f.size(),M+1)){ ans += f.at(i); } return ans.val(); } #ifdef DEBUG ll naive(){ return 1; } #endif int main(){ input(); #ifdef DEBUG showall(); cout << "--- Logic ---" << endl; #endif ll ans=logic(); cout<