#include<bits/stdc++.h> using namespace std; const int M=998244353; typedef long long ll; ll f[55][530]; //前i项，答案为j的方案数 int a[55]; int Pow(int a,int b){ int sum=1; while(b) { if(b & 1) sum=sum*a%11; a=a*a%11; b>>=1; } return sum; } int main(){ int n,k,ka,kb; cin>>n>>k>>ka>>kb; for(int i=1;i<=n+1;++i) a[i]=Pow(ka,n-i+1); f[1][ ka*a[1]+250 ]=f[2][ ka*a[1]+kb*a[2]+250 ]=1; for(int i=3;i<=n+1;++i) for(int kk=-250;kk<=250;++kk) for(int j=-k;j<=k;++j) f[i][kk+250]=(f[i][kk+250]+f[i-1][ kk-a[i]*j+250 ])%M; cout<<f[n+1][kb+250]<<'\n'; return 0; }