#include<bits/stdc++.h>

using namespace std;

typedef long long i64;

int n, m, q;
vector<vector<int>> a, f;
i64 ra, rb, rx, ry, rz, ans;

int main()
{
    cin >> n >> m;
    a.resize(n, vector<int>(m));
    for(int i = 0; i < n; i++)
    {
        string s;
        cin >> s;
        for(int j = 0; j < m; j++)
            a[i][j] = s[j] - '0';
    }

    f.resize(n, vector<int>(m));
    fill(f[n - 1].begin(), f[n - 1].end(), n - 1);
    for(int i = n - 2; i >= 0; i--)
        for(int j = 0; j < m; j++)
            f[i][j] = (a[i][j] == a[i + 1][j]) ? f[i + 1][j] : i;
    for(auto &vec: f)
        sort(vec.begin(), vec.end());

    cin >> q >> rx >> ry >> rz;
    i64 lastans = 0;
    ra = 1, rb = n;
    for(int i = 1; i <= q; i++)
    {
        if(i > 1)
        {
            ra = (ra * rx + lastans * ry + rz) % n + 1;
            rb = (rb * ry + lastans * rz + rx) % n + 1;
        }
        i64 l = ra - 1, r = rb - 1;
        if(l > r)
            swap(l, r);
        i64 nowans = f[l].end() - lower_bound(f[l].begin(), f[l].end(), r);
        ans += nowans, lastans = nowans;
    }

    cout << ans << endl;

    return 0;
}