#include <cstdio>
#include <algorithm>

constexpr int N = 800001;
constexpr int M = 1 << 21;
char buf[N];
int trie[N][26];
int pos[100000];
bool marked[N];
int eulerID[N];
int now;
int rmq[M * 2];

int readint() {
	int n;
	scanf("%d", &n);
	return n;
}

long long readlong() {
	long long n;
	scanf("%lld", &n);
	return n;
}

void dfs(int u, int depth) {
	eulerID[u] = now;
	rmq[M + now++] = depth;
	for (int i = 0; i < 26; i++) {
		if (!trie[u][i]) {
			continue;
		}
		dfs(trie[u][i], depth + 1);
		rmq[M + now++] = depth;
	}
}

int main() {
	const int n = readint();
	int cnt = 1;
	for (int i = 0; i < n; i++) {
		scanf("%s", buf);
		int u = 0;
		for (int j = 0; buf[j] != 0; j++) {
			char c = buf[j] - 'a';
			if (!trie[u][c]) {
				trie[u][c] = cnt++;
			}
			u = trie[u][c];
		}
		pos[i] = u;
	}
	dfs(0, 0);
	for (int i = M - 1; i >= 1; i--) {
		rmq[i] = std::min(rmq[i * 2], rmq[i * 2 + 1]);
	}
	const int m = readint();
	const long long x = readlong();
	const long long d = readlong();
	int ii = x % (n - 1);
	int jj = x / (n - 1);
	const int di = d % (n - 1);
	const int dj = d / (n - 1);
	long long ans = 0;
	for (int foo = 0; foo < m; foo++) {
		int i = jj;
		int j = ii;
		if (i > j) {
			std::swap(i, j);
		} else {
			j++;
		}
		ii += di;
		if (ii >= n - 1) {
			ii -= n - 1;
			jj++;
		}
		jj += dj;
		if (jj >= n) {
			jj -= n;
		}
		int l = eulerID[pos[i]] + M;
		int r = eulerID[pos[j]] + 1 + M;
		if (l > r) {
			std::swap(l, r);
		}
		int val = 123456789;
		while (l < r) {
			if (l & 1) {
				val = std::min(val, rmq[l++]);
			}
			if (r & 1) {
				val = std::min(val, rmq[--r]);
			}
			l /= 2;
			r /= 2;
		}
		ans += val;
	}
	printf("%lld\n", ans);
}