#include<bits/stdc++.h>
using namespace std;
#define ll long long
namespace IO{//by cyffff
	int len=0;
	char ibuf[(1<<21)+1],*iS,*iT,out[(1<<25)+1];
	#if ONLINE_JUDGE
	#define gh() (iS==iT?iT=(iS=ibuf)+fread(ibuf,1,(1<<21)+1,stdin),(iS==iT?EOF:*iS++):*iS++)
 	#else
	#define gh() getchar()
	#endif
	#define reg register
	inline int read(){
		reg char ch=gh();
		reg int x=0;
		reg char t=0;
		while(ch<'0'||ch>'9')   t|=ch=='-',ch=gh();
		while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=gh();
		return t?-x:x;
	}
	inline void putc(char ch){
		out[len++]=ch;
	}
	template<class T>
	inline void write(T x){
		if(x<0)putc('-'),x=-x;
		if(x>9)write(x/10);
		out[len++]=x%10+48;
	}
	inline void flush(){
		fwrite(out,1,len,stdout);
		len=0;
	}
	inline char getc(){
		char ch=gh();
		while(ch<'0'||ch>'1') ch=gh();
		return ch;
	}
}
using IO::read;
using IO::write;
using IO::flush;
using IO::getc;
using IO::putc;
#define pii pair<int,int>
#define mpr make_pair
#define fir first
#define sec second
const int N=1e5+10;
int n,m,q,x,y,z,las=-1,l,r;
vector<bool>a[N];
vector<int>pr[N];
inline pii GetQ(){
	if(las==-1){ l=1,r=n; }
	else{
		l=(1ll*l*x+1ll*las*y+z)%n+1;
		r=(1ll*r*y+1ll*las*z+x)%n+1;
	}
	return mpr(min(l,r),max(l,r));
}
ll ans;
int main(){
//	freopen("ex_1.in","r",stdin);
	n=read(),m=read();
	for(int i=1;i<=n;i++){
		a[i].push_back(0);
		for(int j=1;j<=m;j++)
			a[i].push_back(getc()-'0');
	}
	for(int i=1;i<=n;i++){
		pr[i].resize(m+1,0);
		if(i==1) continue;
		for(int j=1;j<=m;j++)
			pr[i][j]=a[i][j]==a[i-1][j]?pr[i-1][j]:i-1;
	}
	for(int i=1;i<=n;i++)
		sort(pr[i].begin()+1,pr[i].end());
	q=read(),x=read(),y=read(),z=read();
	while(q--){
		pii qr=GetQ();
		int l=qr.fir,r=qr.sec;
		las=lower_bound(pr[r].begin(),pr[r].end(),l)-pr[r].begin()-1;
		ans+=las;
	}
	write(ans);
	flush();
}