#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
using namespace std;
#pragma warning(disable:4996)
long long N, M, x, d, sum; string S[100009]; vector<long long>E[100009];
char c[10000009];

bool compare(long long a1, long long a2, long long a3) {
	if (S[a1].size() < a3 || S[a2].size() < a3)return false;
	if (E[a1][a3] == E[a2][a3])return true;
	return false;
}

int main() {
	cin >> N;
	for (int i = 1; i <= N; i++) {
		scanf("%s", c);
		int pos = 0; while (c[pos]) { S[i] += c[pos]; pos++; }
		E[i].resize(S[i].size() + 2, 0);
		long long Y = 1;
		for (int j = 1; j <= S[i].size(); j++) {
			E[i][j] = E[i][j - 1] + (Y*(long long)(S[i][j - 1])); Y *= 257;
		}
	}
	cin >> M >> x >> d;
	for (int i = 1; i <= M; i++) {
		long long A = (x / (N - 1)) + 1;
		long long B = (x % (N - 1)) + 1;
		if (A > B)swap(A, B);
		else B = B + 1;
		x = (x + d) % (N * (N - 1));

		long long L = 0, R = 1000000, M;
		while (true) {
			M = (L + R) / 2;
			bool p1 = compare(A, B, M), p2 = compare(A, B, M + 1);
			if (p1 == true && p2 == false)break;
			else if (p1 == false)R = M;
			else L = M;
		}
		sum += M;
	}
	cout << sum << endl;
	return 0;
}