#include <vector>
#include <iostream>
#include <algorithm>
#pragma warning(disable : 4996)
using namespace std;
const int mod1 = 1000000439;
const int mod2 = 1000000637;
const int bs = 100000969;
int N, M, a[3000009], b[3000009]; long long x, d; char s[800009]; vector<int> h1[100009], h2[100009];
int main() {
	scanf("%d", &N);
	for (int i = 0; i < N; i++) {
		scanf("%s", s);
		int c = 0; while (s[c]) c++;
		h1[i].resize(c + 1);
		h2[i].resize(c + 1);
		for (int j = 0; j < c; j++) {
			h1[i][j + 1] = (1LL * h1[i][j] * bs + s[j]) % mod1;
			h2[i][j + 1] = (1LL * h2[i][j] * bs + s[j]) % mod2;
		}
	}
	scanf("%d %lld %lld", &M, &x, &d);
	long long t = 1LL * N * (N - 1), ret = 0;
	for (int i = 1; i <= M; i++) {
		a[i] = x / (N - 1);
		b[i] = x - 1LL * a[i] * (N - 1);
		if (a[i] > b[i]) swap(a[i], b[i]);
		else b[i]++;
		x = (x + d >= t ? x + d - t : x + d);
		int s = min(h1[a[i]].size(), h1[b[i]].size()), l = 0, r = s + 1;
		while (r - l > 1) {
			int m = (l + r) >> 1;
			if (h1[a[i]][m] == h1[b[i]][m] && h2[a[i]][m] == h2[b[i]][m]) l = m;
			else r = m;
		}
		ret += l;
	}
	printf("%lld\n", ret);
	return 0;
}