#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; const ll mod=998244353; int main(){ ll N,K; cin>>N>>K; vector A(N); for (ll i=0;i>A[i]; } vector diff(N); vector cum(N); ll S = A[0]; for (ll i=1;i> dp(N,vector(3*K+1,0)); for (ll minus=0;minus<3*K+1;minus++){ if (-K<=A[0]-minus && A[0]-minus<=K){ dp[0][minus] = 1; } if (minus!=0){ dp[0][minus] += dp[0][minus-1]; dp[0][minus] %= mod; } //cout<