#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
#define pii pair<ll,ll>
using namespace std;
bool Mbe;
ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		x=x*10+ch-'0';
		ch=getchar();
	}
	return x*f;
}
void write(ll x){
	if(x<0)x=-x,putchar('-');
	if(x>9)write(x/10);
	putchar('0'+x%10);
}
const ll N=1e7+9,Mod=998244353;
ll n,m,l,r,X,ans[N],c[N];
char s[N];
void Ed(){
	ll pw=1,res=0;
	rep(i,1,l)pw=pw*233%Mod;
	rep(i,l,r){
		ans[i]=(ans[i]+Mod)%Mod;
		res=res^(pw*ans[i]%Mod);
		pw=pw*233%Mod;
	}
	write(res),putchar('\n');
}
namespace Sub1{
	ll a[20],len,id[20],b[20],cnt[20],v[20];
	void solve(){
		rep(i,0,m-1){
			rep(j,1,X+s[i]-'0')a[++len]=i;
		}
		rep(i,1,n)id[i]=i;
		do{
			rep(i,1,n)b[i]=a[id[i]];
			rep(i,0,m+1)cnt[i]=0;
			rep(i,1,n){
				rep(j,0,m+1)v[j]=0;
				ll mx=0;
				rep(j,i,n){
					v[b[j]]=1;
					while(v[mx])mx++;
					cnt[mx]++;
				}
			}
			per(i,m,0)cnt[i]+=cnt[i+1];
			rep(i,l,r)ans[i]=max(ans[i],cnt[i]);
		}while(next_permutation(id+1,id+n+1));
		Ed();
	}
}
namespace Sub4{
	void solve(){
		ll bin=n*(n+1)/2;
		if(m==1){
			ans[0]=bin%Mod;
			ans[1]=bin%Mod;
		}
		else {
			ans[0]=bin%Mod;
			ans[1]=(bin%Mod-c[1]+Mod)%Mod;
		}
		Ed();
	}
}
namespace Sub5{
	void solve(){
		ll bin=n*(n+1)/2%Mod;
		rep(i,1,m-1)bin=(bin-(n-i+1)+Mod)%Mod;
		bin=(bin+Mod)%Mod;
		ans[m]=bin;
		Ed();
	}
}
namespace Sub6{
	void solve(){
		ll bin=n*(n+1)/2%Mod;
		ans[0]=bin;
		rep(i,1,m){
			ll x=(m-i)/2;
			ll y=(m-i)-x;
			ans[i]=(x+1)*(y+1)%Mod; 
		}
		Ed();
	}
}
namespace Sol{
	ll res,fl=1,cur;
	void solve(){
		ans[0]=n*(n+1)/2%Mod;
		rep(i,1,m){
			cur+=X+s[i-1]-'0';
			fl&=(s[i-1]=='1');
			ll rst=n-cur;
			ll c=X+fl+1;
			ll op=(cur*2-i+2)*(i-1)/2;
			ll t=min(i*2-2,rst);
			op+=(i*2-1+t/2)*(t/2)/2;
			op+=(i*2-1+t-t/2)*(t-t/2)/2;
			rst-=t;
			ll o=rst%c;
			op+=(c-o)*(i*4-3+rst/c)*(rst/c)/2+o*(i*4-3+rst/c+1)*(rst/c+1)/2;
			op=n*(n+1)/2-op;
			op%=Mod;
			ans[i]=op; 
		}
		Ed();
	}
}
bool Med;
int main(){
	cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
	m=read(),l=read(),r=read(),X=read();
	scanf("%s",s);
	n=m*X;
	rep(i,0,m-1)n+=(s[i]-'0');rep(i,0,m-1)c[i]=s[i]-'0'+X;
	if(n<=9&&m<=9)return Sub1::solve(),0;
	if(m<=2&&l==0&&r==1)return Sub4::solve(),0;
	if(l==r&&r==m)return Sub5::solve(),0;
	if(n==m&&X==1)return Sub6::solve(),0;
	Sol::solve(); 
	return 0;
}