#include <bits/stdc++.h>
#define sz(x) ((int)(x).size())
#define all(x) begin(x), end(x)
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define endl '\n'
#define log(...) (void(0))
#endif
using namespace std;
using ll = long long;
using lf = long double;
using ull = unsigned long long;

const int N = 1e5 + 9;
int n, m, k, x, y, z, s[N], lastans;
ll sum;
string buffer;
vector<int> a[N], vec[N];

int solve(int l, int r) {
  // assert(l <= r);
  int ans;
  if (l == r) {
    ans = m;
  } else {
    ans = upper_bound(all(vec[r]), l) - vec[r].begin();
  }
  log("solve l=%d r=%d ==> %d\n", l, r, ans);
  lastans = ans;
  sum += ans;
  return ans;
}

int main() {
#ifdef memset0
  freopen("B.in", "r", stdin);
#endif
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> buffer;
    a[i].resize(sz(buffer));
    for (int j = 0; j < m; j++) {
      a[i][j] = buffer[j] == '1';
    }
  }
  for (int j = 0; j < m; j++) {
    int lst = -1;
    for (int i = 1; i <= n; i++) {
      if (i == 1 || a[i][j] != a[i - 1][j]) {
        lst = i;
      }
      vec[i].push_back(lst);
    }
  }
  for (int i = 1; i <= n; i++) {
    sort(all(vec[i]));
    // for (int x : vec[i]) log("%d, ", x);
    // log("\n");
  }

  cin >> k;
  cin >> x >> y >> z;
  int a = 1, b = n;
  solve(1, n);
  for (int i = 2; i <= k; i++) {
    a = ((ll)a * x + (ll)lastans * y + z) % n + 1;
    b = ((ll)b * y + (ll)lastans * z + x) % n + 1;
    solve(min(a, b), max(a, b));
  }
  cout << sum << endl;
}

/*
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 2, 2, 2, 2, 2, 2,
1, 1, 1, 2, 2, 2, 2, 3, 3, 3,
1, 2, 3, 4, 4, 4, 4, 4, 4, 4,
solve l=1 r=4 ==> 1
solve l=3 r=3 ==> 10
solve l=2 r=3 ==> 7
solve l=1 r=3 ==> 3
21

*/