#include <bits/extc++.h>

#define inline __always_inline
template <typename T> inline void chkmin(T &x, const T &y) { if (x > y) x = y; }
template <typename T> inline void read(T &x)
{
	char ch;
	for (ch = getchar(); !isdigit(ch); ch = getchar());
	for (x = 0; isdigit(ch); ch = getchar()) x = x * 10 + (ch - '0');
}
inline void digit(int &x) { for (x = getchar(); !isdigit(x); x = getchar()); x -= '0'; }
const int MaxM = 1e5 + 5, MaxN = MaxM, MaxQ = 2e6 + 5;

int n, m, q, **len;
std::vector<std::vector<bool>> s;
namespace gen
{
	int x, y, z, a, b, l, r;
	inline void init()
	{ 
		read(x), read(y), read(z);
		a = l = 1, b = r = n;
	}
	inline void gen(int ans)
	{
		a = (1l * a * x + 1l * ans * y + z) % n + 1;
		b = (1l * b * y + 1l * ans * z + x) % n + 1;
		l = std::min(a, b), r = std::max(a, b);
	}
} // namespace gen
using gen::l, gen::r;
int main()
{
	read(n), read(m);
	s.resize(n + 1);
	for (int i = 1; i <= n; i++)
		s[i].resize(m + 1);
	len = (int **)calloc(n + 1, 8);
	for (int i = 1; i <= n; i++)
		len[i] = (int *)calloc(m + 1, 4);
	for (int i = 1; i <= n; i++)
		for (int j = 1, x; j <= m; j++)
			digit(x), s[i][j] = x;
	for (int i = n - 1; i; i--)
		for (int j = 1; j <= m; j++)
			len[i][j] = s[i][j] == s[i + 1][j] ? len[i + 1][j] + 1 : 0;
	for (int i = n - 1; i; i--)
		std::sort(len[i] + 1, len[i] + m + 1);
	read(q);
	gen::init();
	int64_t sum = 0; int ans = 0;
	do
	{
		sum += ans = len[l] + m + 1 - std::lower_bound(len[l] + 1, len[l] + m + 1, r - l);
		gen::gen(ans);
	} while (--q);
	printf("%ld", sum);
	return 0;
}