// Author: lycc
// 
// Problem: A. 【NOIP Round #8】位集
// Contest: Public Judge - Public NOIP Round #8 (Div. 1, 提高)
// URL: https://pjudge.ac/contest/1847/problem/21861
// Memory Limit: 1024 MB
// Time Limit: 1000 ms

#include <bits/stdc++.h>
#define int long long
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define pb emplace_back
#define For(i, x, y) for (int i = (x); i <= (y); i ++)
#define rep(i, x, y) for (int i = (x); i >= (y); i --)
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define sz(v) (int)((v).size())
#define ull unsigned long long
#define ls (p << 1)
#define rs (p << 1 | 1)
#define mp make_pair
#define i128 __int128
#define db long double
#define vi vector< int >
#define mem(v, x) memset(v, x, sizeof(v))
#define A3 array< int, 3 >
#define A4 array< int, 4 >
#define vpii vector< pair< int, int > >
using namespace std;
mt19937_64 rnd(time(0));
template< typename T > void cmin(T &x, T y) { return x = min(x, y), void(); }
template< typename T > void cmax(T &x, T y) { return x = max(x, y), void(); }
int ksm(int x, int y, int p) {
    int v = 1; x %= p;
    while (y) v = 1ll * v * ((y & 1) ? x : 1) % p, x = 1ll * x * x % p, y >>= 1;
    return (v % p + p) % p;
}
void file() {
	freopen("1.in", "r", stdin);
	freopen("1.out", "w", stdout);
	return;
}
bool MemoryST;
const int N = 2e6 + 5;
const int mod = 998244353;
const long long INF = 1e18;
const int base = 13131;
int n, m, q, x, y, z;
int a[N * 10], b[N * 10];
string s, t;
vi f, g;
vi pos[N]; 
void Main() {
	cin >> n >> m;
	f.resize(m + 1); g.resize(m + 1);
	int lst = 0;
	For (i, 1, n) {
		cin >> s; s = " " + s;
		if (i == 1) {
			For (j, 1, m) f[j] = 1;
		} else {
			For (j, 1, m) {
				if (s[j] == t[j]) f[j] = g[j];
				else f[j] = i;
			}
		}
		For (j, 1, m) pos[i].pb(f[j]);
		sort(all(pos[i]));
		swap(s, t);
		swap(f, g);
	}
	cin >> q >> x >> y >> z;
	int ans = 0;
	For (i, 1, q) {
		if (i == 1) a[i] = 1, b[i] = n;
		else a[i] = (a[i - 1] * x + lst * y + z) % n + 1, b[i] = (b[i - 1] * y + lst * z + x) % n + 1;
		int l = min(a[i], b[i]), r = max(a[i], b[i]);
		ans += (lst = (ub(all(pos[r]), l) - pos[r].begin()));
	}
	cout << ans;
    return;
}
bool MemoryED;
signed main() {
	// file();
    ios :: sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cerr << fixed << setprecision(6) << (&MemoryST - &MemoryED) / 1048576.0 << "MB\n";
    int TESTCNT = 1;
    // cin >> TESTCNT;
    while (TESTCNT --) Main();
    cerr << endl << 1e3 * clock() / CLOCKS_PER_SEC << "ms"; 
    return 0;
}