#include <bits/stdc++.h>

#ifdef __linux__
#define getchar getchar_unlocked
#endif

using ull = unsigned long long;
ull sbuf[100100];
ull *s[100000];
int len[100000];
int slen[100000];
char buf[800100];
int rmq[18][100000];
int lcp[100000];

int main() {
	long long n;
	scanf("%lld", &n);
	ull *ptr = sbuf;

	for (int i = 0; i < n; i++) {
		char *t = buf;
		while ((t[0] = getchar()) < 'a');
		t++;
		while ((*t = getchar()) >= 'a') t++;
		*t = 0;
		len[i] = t - buf;
		slen[i] = (len[i] + 7) / 8;
		s[i] = ptr;
		for (int j = 0; j < len[i]; j += 8) {
			long long val = 0;
			for (int k = 0; k < 8; k++) {
				if (buf[j + k] == 0) {
					break;
				}
				val |= (long long)(buf[j + k] - 'a' + 1) << (8 * (7 - k));
			}
			*ptr = val;
			ptr++;
		}
	}
	std::vector<int> perm(n);
	for (int i = 0; i < n; i++) {
		perm[i] = i;
	}
	std::sort(perm.begin(), perm.end(), [&](int i, int j) {
		int k;
		for (k = 0; k < std::min(slen[i], slen[j]); k++) {
			if (s[i][k] != s[j][k]) {
				return s[i][k] < s[j][k];
			}
		}
		return k != slen[j];
	});
    std::vector<int> iperm(n);
    for (int i = 0; i < n; i++) {
        iperm[perm[i]] = i;
    }

	for (int i = 0; i < n - 1; i++) {
		const int l = perm[i];
		const int r = perm[i + 1];
		const int nl = slen[l];
		const int nr = slen[r];
        int h = 0;
		while (h < std::min(nl, nr) && s[l][h] == s[r][h]) {
			h++;
		}
        if (h == nl) {
			lcp[i] = len[l];
		} else if (h == nr) {
			lcp[i] = len[r];
		} else {
			lcp[i] = h * 8 + 7 - std::__lg(s[l][h] ^ s[r][h]) / 8;
		}
	}

	for (int i = 0; i < 100000; i++) {
		rmq[0][i] = lcp[i];
	}
	for (int i = 0; i < 17; i++) {
		for (int j = 0; j + (1 << i) < 100000; j++) {
			rmq[i + 1][j] = std::min(rmq[i][j], rmq[i][j + (1 << i)]);
		}
	}

	long long ans = 0;
	int m;
    long long x, d;
	scanf("%d %lld %lld", &m, &x, &d);
	int ii = x % (n - 1);
	int jj = x / (n - 1);
	int di = d % (n - 1);
	int dj = d / (n - 1);
	while (m--) {
		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;
		}
        i = iperm[i];
        j = iperm[j];
        if (i > j) {
            std::swap(i, j);
        }
        const int k = std::__lg(j - i);
        ans += std::min(rmq[k][i], rmq[k][j - (1 << k)]);
	}

	printf("%lld\n", ans);
}