#include<bits/stdc++.h>
#define ll long long
#define rg int
#define ci const int
#define ls x<<1
#define rs x<<1|1
#define mid ((l+r)>>1)
#define ld long double
#define fo(i,l,r) for(int i=(l);i<=(r);++i)
#define fd(i,l,r) for(int i=(l);i>=(r);--i)
#define fu(i,l,r) for(int i=(l);i<(r);++i)
#define gcd __gcd
#define P(x) __builtin_popcountll(x)
using namespace std;
ci N=2e5+5,M=1e7+5,mod=998244353,_g=3,_ig=(mod+1)/3;
ll ksm(ll a,ll b=mod-2)
{
	ll ans=1;
	while(b)
	{
		if(b&1)ans=(ll)ans*a%mod;
		a=(ll)a*a%mod,b>>=1;
	}
	return ans;
}
const ld eps=1e-10;
inline ll read(){ll u,f=1;char o;while((o=getchar())<48||o>57)if(o==45)f=-1;u=(o^48);while((o=getchar())>=48&&o<=57)u=(u<<1)+(u<<3)+(o^48);return u*f;}
void write(ll x){if(x<0)putchar(45),x=-x;if(x>9)write(x/10);putchar(x%10+48);}
mt19937 rad(chrono::steady_clock::now().time_since_epoch().count());
ll n,m,l,r,k,x,s,a[M],f[M];
ll w[N];
char ch[M];
bool t[N];
void dg(int x)
{
	if(x>s)
	{
		fo(k,0,m)
		{
			ll p=0;
			fo(i,1,s)
			{
				ll o=0;
				fo(i,0,m-1)t[i]=0;
				fo(j,i,s)
				{
					t[w[j]]=1;
					while(t[o])++o;
					if(o>=k)++p;
				}
			}
			f[k]=max(f[k],p);
		}
		return;
	}
	fo(i,1,m)if(a[i])
	{
		a[i]--;
		w[x]=i-1;
		dg(x+1);
		a[i]++;
	}
}
int main()
{//freopen("1.in","r",stdin);
//	freopen("mex.in","r",stdin);
//	freopen("mex.out","w",stdout);
	int T=1;
	while(T--)
	{
		m=read(),l=read(),r=read(),x=read();
		scanf("%s",ch+1);
		fo(i,1,m)
		{
			a[i]=x;s+=x;
			if(ch[i]=='1')a[i]++,s++;
		}
		if(m<=2&&l==0&&r==1)
		{
			f[0]=(s*(s+1)/2)%mod;
			f[1]=(f[0]-a[2]+mod)%mod;
		}
		else
		{
			if(x==1&&s==m)
			{//cout<<"we";
				f[0]=(s*(s+1)/2)%mod;
				fo(i,1,m)
				{
					ll o=m-i;
					f[i]=(o/2+1)*(o-o/2+1)%mod;
				}
			}
			else
			{
				s%=mod;
				if(m==l&&m==r)
				{//cout<<'q';
					f[m]=(s*(s+1)/2)%mod;
					fo(i,1,m-1)f[m]=(f[m]-(s-i+1)+mod)%mod;
				}
				else dg(1);
			}
		}
		ll ans=0,u=ksm(233,l);
		fo(i,l,r)
		{
			ans^=(u*f[i]%mod);
			u=u*233%mod;
		}
		cout<<ans<<'\n';
	}
	return 0;
}