#include<bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int mininf = 1e9 + 7;
#define int long long
#define pb emplace_back
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
inline void write(int x){if(x<0){x=~(x-1);putchar('-');}if(x>9)write(x/10);putchar(x%10+'0');}
#define put() putchar(' ')
#define endl puts("")
const int MAX = 1e6 + 10;
int n, m;

inline int to(int x, int y){
	if(x <= 0)	return 0;
	return (x - 1) * m  + y;
}

int a[MAX];

namespace subtask1{
	int s[MAX];
	void solve(){
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= m; j++){
				if(a[to(i, j)])	s[to(i, j)] = 1;
				if(i == 1)	continue;
				s[to(i, j)] += s[to(i - 1, j)];
			}
		}
		int k = read();
		int X = read(), Y = read(), Z = read();
		int l = 1, r = n;
		int A = 1, B = n;
		int ret = 0;
		while(k--){
			int ans = 0;
			for(int i = 1; i <= m; i++){
				int cnt = s[to(r, i)] - s[to(l - 1, i)];
				if(cnt == 0 or cnt == r - l + 1){
					ans++;
				}
			}
			ret += ans;
			A = (A * X + ans * Y + Z) % n + 1;
			B = (B * Y + ans * Z + X) % n + 1;
			l = min(A, B), r = max(A, B);
		}
		write(ret), endl;
	}
}

namespace subtask2{
	bitset <100001> bt[405];
	bitset <100001> bt2[405];
	
	int ans[405][405];
	
	void solve(){
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= m; j++){
				bt[i][j] = a[to(i, j)];
				bt2[i][j] = (a[to(i, j)] ^ 1);
			}
		}
		for(int i = 1; i <= n; i++){
			bitset <100001> now;
			for(int j = i; j >= 1; j--){
				now = now | bt[j];
				ans[j][i] += (m - now.count());
			}
		}
		for(int i = 1; i <= n; i++){
			bitset <100001> now;
			for(int j = i; j >= 1; j--){
				now = now | bt2[j];
				ans[j][i] += (m - now.count());
			}
		}
		int k = read();
		int X = read(), Y = read(), Z = read();
		int l = 1, r = n;
		int A = 1, B = n;
		int ret = 0;
		while(k--){
			int Ans = ans[l][r];
			ret += Ans;
			// write(l), put(), write(r), put(), write(Ans), endl;
			A = (A * X + Ans * Y + Z) % n + 1;
			B = (B * Y + Ans * Z + X) % n + 1;
			l = min(A, B), r = max(A, B);
		}
		write(ret), endl;
	}
}

namespace subtask3{
	const int MAX2 = 5e3 + 10;
	bitset <2505> f[14][MAX2];
	bitset <2505> f2[14][MAX2];
	int lg2[MAX];
	
	void solve(){
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= m; j++){
				f[0][i][j] = a[to(i, j)];
				f2[0][i][j] = (a[to(i, j)] ^ 1);
			}
		}
		for(int i = 1; i < 14; i++){
			for(int j = 1; j + (1ll << i) - 1 <= n; j++){
				f[i][j] = f[i - 1][j] | f[i - 1][j + (1ll << (i - 1))];
			}
		}
		for(int i = 1; i < 14; i++){
			for(int j = 1; j + (1ll << i) - 1 <= n; j++){
				f2[i][j] = f2[i - 1][j] | f2[i - 1][j + (1ll << (i - 1))];
			}
		}
		for(int i = 2; i <= n; i++){
			lg2[i] = lg2[i >> 1] + 1;
		}
		int k = read();
		int X = read(), Y = read(), Z = read();
		int l = 1, r = n;
		int A = 1, B = n;
		int ret = 0;
		while(k--){
			int Ans = 0;
			int len = (r - l + 1);
			len = lg2[len];
			Ans += m - (f[len][l] | f[len][r - (1ll << len) + 1]).count();
			Ans += m - (f2[len][l] | f2[len][r - (1ll << len) + 1]).count();
			// int Ans = ans[l][r];
			ret += Ans;
			A = (A * X + Ans * Y + Z) % n + 1;
			B = (B * Y + Ans * Z + X) % n + 1;
			l = min(A, B), r = max(A, B);
		}
		write(ret), endl;
	}
}

mt19937 Rnd(time(0));

void solve(){
	n = read(), m = read();
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			char ch = getchar();
			while(ch != '0' and ch != '1')	ch = getchar();
			a[to(i, j)] = ch - '0';
			// a[to(i, j)] = Rnd() % 2;
		}
	}
	if(n <= 400){
		subtask2::solve();
	}else if(m <= 200){
		subtask1::solve();
	}else{
		subtask3::solve();
	}
	return ;
}

signed main(){
	int t = 1;
	while(t--)	solve();
	return 0;
}