#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define fi first
#define se second
#define mkp make_pair
#define pir pair <ll, ll>
#define pb emplace_back
#define i128 __int128
using namespace std;
template <class T>
void rd(T &x) {
	char ch; ll f = 0;
	while(!isdigit(ch = getchar()))
		if(ch == '-') f = 1;
	x = ch - '0';
	while(isdigit(ch = getchar()))
		x = (x << 1) + (x << 3) + ch - '0';
	if(f) x = -x;
}
namespace Initial {
	const ll maxn = 1e6 + 10, mod = 998244353;
	const ll pls(const ll x, const ll y) { return x + y >= mod? x + y - mod : x + y; }
	void add(ll &x, const ll y) { x = x + y >= mod? x + y - mod : x + y; }
} using namespace Initial;
ll n, m, k, x, y, z, a, b, l, r, ans_sum;
string str[maxn];
vector <ll> lst[maxn];
int main() {
	rd(n), rd(m);
	for(ll i = 1; i <= n; i++) {
		cin >> str[i]; lst[i].resize(m);
		if(i == 1)
			for(ll j = 0; j < m; j++) lst[i][j] = 1;
		else
			for(ll j = 0; j < m; j++)
				if(str[i][j] == str[i - 1][j]) lst[i][j] = lst[i - 1][j];
				else lst[i][j] = i;
	} rd(k), rd(x), rd(y), rd(z);
	for(ll i = 1; i <= n; i++)
		sort(lst[i].begin(), lst[i].end());
	a = 1, b = n;
	while(k--) {
		l = min(a, b), r = max(a, b);
		ll ans = upper_bound(lst[r].begin(), lst[r].end(), l) - lst[r].begin();
		ans_sum += ans;
		a = (a * x + ans * y + z) % n + 1;
		b = (b * y + ans * z + x) % n + 1;
	} printf("%lld\n", ans_sum);
	return 0;
} /*

*/