#include<bits/stdc++.h>
using namespace std;
const int N=2e6+5;
const int inf=1e9+7;

inline int wrd(){int x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+c-48,c=getchar();}return x*f;}
inline void write(long long x){if(x<0)putchar('-'),x=-x;if(x>9)write(x/10);putchar(x%10+48);}

int n,m,q;
vector<vector<int>> a;
long long ans;

string s[2];

int ask(int x,int y){
	if(x>y) swap(x,y);
	int as(-1),l(0),r(m-1);
	while(l<=r){
		int mid=(l+r)>>1;
		if(a[y][mid]<=x) as=mid,l=mid+1;
		else r=mid-1;
	}
	return as+1;
}

signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>m,a.resize(n+1);
	for(int i=1;i<=n;++i) a[i].resize(m,0);
	for(int i=1;i<=n;++i){
		int o=i&1; cin>>s[o];
		if(i>1){
			for(int j=0;j<m;++j){
				if(s[o][j]==s[o^1][j]) a[i][j]=a[i-1][j];
				else a[i][j]=i;
			}
		}else for(int j=0;j<m;++j) a[i][j]=1;
	}
	for(int i=1;i<=n;++i) sort(a[i].begin(),a[i].end());
	cin>>q;
	int x,y,z; cin>>x>>y>>z;
	int l(1),r(n),as;
	ans+=(as=ask(l,r)),--q;
	while(q--){
		l=(1ll*l*x+1ll*as*y+z)%n+1,r=(1ll*r*y+1ll*as*z+x)%n+1;
		ans+=(as=ask(l,r));
	}
	cout<<ans<<"\n";
	return 0;
}