样例2始终过不了，求救

#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int M = 1e9 + 7;
long long a,b,c,n; 
long long dp[N];
int main(){
	scanf("%lld%lld%lld%lld",&n,&a,&b,&c);
	for(int i = 0;i <= c;i++){
		dp[i] = 1;
	}
	for(int i = c + 1;i <= n;i++){
		dp[i] = 0;
		if(i - a >= 0){
			dp[i] = (dp[i] + dp[i - a]) % M;
		} 
		if(i - b >= 0){
			dp[i] = (dp[i] + dp[i - b]) % M;
		}
	}
	cout<<dp[n]<<endl;
	return 0;
}