#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using pii = pair<int, int>;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<string> s(n);
    for (int i=0;i<n;++i) cin >> s[i];
    int k;
    i64 x, y, z;
    cin >> k >> x >> y >> z;
    vector<vector<int> > f(n, vector<int>(m));
    f[n - 1] = vector<int>(m, n - 1);
    for (int i=n-2;i>=0;--i)
        for (int j=0;j<m;++j)
            if (s[i][j] == s[i + 1][j]) f[i][j] = f[i + 1][j];
            else f[i][j] = i;
    for (int i=0;i<n;++i) sort(f[i].begin(), f[i].end());
    int lst = 0, a = 1, b = n;
    i64 ans = 0;
    for (int i=0;i<k;++i)
    {
        if (i)
        {
            a = (a * x + lst * y + z) % n + 1;
            b = (b * y + lst * z + x) % n + 1;
        }
        int l = min(a, b) - 1, r = max(a, b) - 1;
        ans += (lst = f[l].end() - lower_bound(f[l].begin(), f[l].end(), r));
    }
    cout << ans << '\n';
    return 0;
}