#include<bits/stdc++.h> using namespace std; #define int long long #define mod 998244353 int n,kk,k[105]; int ksm[105]; int dfs(int x,int nowz) { if(x>=n+1) { if(abs(k[2]-nowz)<=kk)return 1; else return 0; } int ans=0; for(int i=-kk; i<=kk; i++) { ans+=dfs(x+1,nowz+ksm[n-x+1]*i); ans%=mod; } return ans; } signed main() { cin>>n>>kk>>k[1]>>k[2]; if(kk==0) { cout<<1<<endl; return 0; } if(k[1]==0&&k[2]==0) { int ans=1; for(int i=3; i<=n+1; i++) { ans*=(2*kk+1); ans%=mod; } cout<<ans<<endl; return 0; } ksm[1]=(k[1]+110)%11; for(int i=2; i<=kk; i++) { ksm[i]=(ksm[i-1]*k[1]+abs(k[1])*11)%11; } cout<<dfs(3,ksm[n]*k[1]+ksm[n-1]*k[2])<<endl; return 0; }