#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(b);i>=(a);i--)
#define endl "\n"
#define For(i,u) for(int i=head[u];i;i=e[i].next)
#define V vector<int>
#define VV vector<V>
#define Debug(a) cout<<"QwQ "<<a<<endl;
#define FST NOT_FST
#define trash_round unrated
#define pint pair<int,int>
#define fi first
#define se second
#define Vp vector<pint>
using namespace std;
int n,m,MOD;
int read()
{
	int x;
	scanf("%d",&x);
	return x;
}
string reads()
{
	char ch=getchar();string s;
	while(ch<'a'||ch>'z'){ch=getchar();}
	while(ch>='a'&&ch<='z'){s+=ch;ch=getchar();}
	return s;
}
char readc()
{
	char ch=getchar();
	while(ch<'a'||ch>'z') ch=getchar();
	return ch;
}

// down is mytrue code ------------------------------

const int N=1e6+5,M=55;

int a[M][M],A[N][M],del[M];//ǰ׺inv(×îºóÒ»ÁÐ)

int B[N][M],b[M][M];//ǰ׺mi(ÿһÁкÍ)

ll u[N],v[N],l[N],r[N],ans[N],D=1e9+7;

char c[N];

int solve(int l,int r)
{
	int ans=0;
	rep(i,0,52)
	{
//		cout<<i<<" "<<A[l-1][i]<<" "<<B[r][i]<<endl;
		(ans+=1ll*A[l-1][i]*B[r][i]%MOD)%=MOD;
	}
//	cout<<ans<<endl;
	if(ans!=0) ans--;
	else ans=MOD-1;
	return ans;
}

int add(int x,int y)
{
	x+=y;
	if(x>=MOD) x-=MOD;
	if(x<0) x+=MOD;
	return x;
}

signed main()
{
	int n=read(),m=read();
	MOD=read();
	int tp=read();
	scanf("%s",c+1);
	A[0][52]=1;
	rep(j,0,52) B[0][j]=1,b[j][j]=1,a[j][j]=1;
	rep(i,1,n)
	{
		int k;
		if(c[i]>='A'&&c[i]<='Z') k=c[i]-'A';
		else k=c[i]-'a'+26;
		int t;
		rep(j,0,52)
		{
			t=add(a[j][k],-del[j]);
			del[j]=add(del[j],t);
			a[j][k]=add(a[j][k],t);
		}
		rep(j,0,52) A[i][j]=add(a[j][52],-del[j]);
		rep(j,0,52) 
		{
			B[i][j]=add(B[i-1][j]*2%MOD,-b[k][j]);
			b[k][j]=B[i-1][j];
		}
	}
//	rep(i,1,n)
//	{
//		rep(j,0,52)
//		{
//			cout<<A[i][j]<<" ";
//		}
//		cout<<endl;
//	}
//	rep(i,1,n)
//	{
//		rep(j,0,52)
//		{
//			cout<<B[i][j]<<" ";
//		}
//		cout<<endl;
//	}
	if(!tp)
	{
		int last=0;
		rep(i,1,m)
		{
			int l=read(),r=read();
			last^=solve(l,r);
		}
		cout<<last<<endl;
	}
	else
	{
		ll x=read(),y=read(),a=read(),b=read(),c=read();
		u[0]=x,v[0]=y;
		rep(i,1,m)
		{
			u[i]=((a*u[i-1]+b*v[i-1]+c*i)^ans[i-1])%D;
			v[i]=((b*u[i-1]+c*v[i-1]+a*i)^ans[i-1])%D;
			l[i]=min(u[i]%n+1,v[i]%n+1);
			r[i]=max(u[i]%n+1,v[i]%n+1);
//			cout<<u[i]<<" "<<v[i]<<" "<<l[i]<<" "<<r[i]<<endl;
			ans[i]=solve(l[i],r[i]);
//			cout<<ans[i]<<endl;
		}
		cout<<ans[m]<<endl;
	}
	return 0;
}