#include<bits/stdc++.h> #define ll long long #define mod (long long)(998244353) using namespace std; ll n, k1, k2, K, cut, t, f[52][40010]; int Pow(ll a, ll b) { ll res = 1; while(b) { if(b & 1) res = res*a%11; a = a*a%11; b >>= 1; } return (res+11)%11; } int main() { scanf("%lld%lld%lld%lld", &n, &K, &k1, &k2); cut = n*K*10; f[2][Pow(k1,n)*k1+Pow(k1,n-1)*k2+cut] = 1; for(int i=3; i<=n+1; i++) { t = Pow(k1, n-i+1); for(int j=-cut; j<=cut; j++) { for(int k=-K; k<=K; k++) { if(j-a*k+cut >= 0) { f[i][j+cut] += f[i-1][j-a*k+cut]; if(f[i][j+cut] >= mod) f[i][j+cut] -= mod; } } } } printf("%lld", f[n+1][k2+cut]%mod); return 0; }