#include<bits/stdc++.h>
#define int long long
#define mod 998244353ll
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
using namespace std;
inline int read(){
	int x=0,fl=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')fl=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*fl;
}
const int maxn=100010;
bool mbe;

int n,m;
int k,l,r,x,y,z,ans,res;
char s[maxn];
vector<int> a[maxn];
#define mid (l+r>>1)
#define ls lc[nd]
#define rs rc[nd]
int tree[maxn<<8],lc[maxn<<8],rc[maxn<<8];
int rt[maxn],idx;
void updata(int &nd,int l,int r,int p){
	int lst=nd;nd=++idx;
	tree[nd]=tree[lst]+1,ls=lc[lst],rs=rc[lst];
	if(l==r)return ;
	if(p<=mid)updata(ls,l,mid,p);
	else updata(rs,mid+1,r,p);
}
int query(int nd,int l,int r,int ql,int qr){
	if(ql>qr||!nd||!tree[nd])return 0;
	if(l>=ql&&r<=qr)return tree[nd];
	if(qr<=mid)return query(ls,l,mid,ql,qr);
	if(ql>mid)return query(rs,mid+1,r,ql,qr);
	return query(ls,l,mid,ql,qr)+query(rs,mid+1,r,ql,qr);
}
vector<int> upd[maxn];
void sovle(){
	n=read();m=read();
	for(int i=0;i<=n;i++)a[i].resize(m+1);
	for(int i=1;i<=n;i++){
		scanf("%s",s+1);
		for(int j=1;j<=m;j++)a[i][j]=(s[j]=='1');
	}
	for(int i=1;i<=m;i++){
		int lst=0;
		for(int j=2;j<=n;j++){
			if(a[j][i]!=a[j-1][i]){
				upd[lst+1].pb(j-1);
				lst=j-1;
			}
		}
		upd[lst+1].pb(n);
	}
	for(int i=1;i<=n;i++){
		rt[i]=rt[i-1];
		for(int j:upd[i])if(j>=i)updata(rt[i],1,n,j);
	}
	k=read();
	x=read(),y=read(),z=read(),l=1,r=n;
	for(int i=1;i<=k;i++){
		int ll=min(l,r),rr=max(l,r);
		ans=query(rt[ll],1,n,rr,n);
		res+=ans;
		l=(l*x+ans*y+z)%n+1;
		r=(r*y+ans*z+x)%n+1;
	}
	printf("%lld\n",res);
}

bool med;
int T;
signed main(){
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	
	// cerr<<(&mbe-&med)/1024.0/1024.0<<" MB\n";
	
	T=1;
	while(T--)sovle();
}