#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<array>
#include<unordered_map>
#include<vector>
#include<bitset>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<random>
#include<numeric>
using namespace std;
#define ll long long
#define ull unsigned long long
#define lc (x<<1)
#define rc (x<<1|1)
#define pii pair<int,int>
#define mkp make_pair
#define fi first
#define se second
const int Mx=100005,p=998244353;
int read(){
	char ch=getchar();
	int Alice=0,Aya=1;
	while(ch<'0'||ch>'9'){
		if(ch=='-') Aya=-Aya;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
		Alice=(Alice<<3)+(Alice<<1)+(ch^48),ch=getchar();
	return (Aya==1?Alice:-Alice);
}
int n,m;
string s[Mx];
vector<int>a[Mx];
int pre[10005][10005];
void Apply(int l,int r){
	//i>=l,j<=r
	pre[l][1]++,pre[l][r+1]--;
}
void Sol1(){
	for(int j=1;j<=m;j++){
		int l=1;
		for(int i=1;i<=n;i++){
			if(s[i][j]!=s[l][j]){
				Apply(l,i-1);
				l=i;
			}
		}
		Apply(l,n);
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			pre[i][j]+=pre[i-1][j]+pre[i][j-1]-pre[i-1][j-1];
		}
	}
	int q=read();
	ll X=read(),Y=read(),Z=read();
	ll lo=1,ro=n,ans=0;
	for(int Id=1;Id<=q;Id++){
		int l=lo,r=ro;
		if(l>r) swap(l,r);
		int res=pre[l][r];
		ans+=res;
		lo=(lo*X+res*Y+Z)%n+1;
		ro=(ro*Y+res*Z+X)%n+1;
	}
	cout<<ans;
}
void Sol2(){
	for(int i=0;i<=n+1;i++) a[i].resize(m+1);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++) a[i][j]=a[i-1][j]+(s[i][j]=='1');
	}
	int q=read();
	ll X=read(),Y=read(),Z=read();
	ll lo=1,ro=n,ans=0;
	for(int Id=1;Id<=q;Id++){
		int l=lo,r=ro;
		if(l>r) swap(l,r);
		int res=0;
		for(int i=1;i<=m;i++) res+=(a[r][i]-a[l-1][i]==0||a[r][i]-a[l-1][i]==r-l+1);
		ans+=res;
		lo=(lo*X+res*Y+Z)%n+1;
		ro=(ro*Y+res*Z+X)%n+1;
	}
	cout<<ans;
}
signed main(){
	n=read(),m=read();
	for(int i=1;i<=n;i++){
		cin>>s[i];
		s[i]=" "+s[i];
	}
	if(n<=10000){
		Sol1();
	}
	else{
		Sol2();
	}
	return 0;
}
/*
Hello!!
Sample:

-------------------
*/