#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
using namespace std;
long long N, M, x, d, sum; string S[100009]; vector<long long>E[100009]; map<pair<long long, long long>, int>MM;
int main() {
	cin >> N;
	for (int i = 1; i <= N; i++) {
		cin >> S[i];
	}
	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));

		if (MM[make_pair(A, B)] >= 1) {
			sum += MM[make_pair(A, B)] - 1;
		}
		else {
			long long cnt = 0;
			for (int j = 0; j < 1000000; j++) {
				if (S[A].size() <= j || S[B].size() <= j)break;
				if (S[A][j] != S[B][j])break;
				cnt++;
			}
			sum += cnt;
			MM[make_pair(A, B)] = cnt + 1;
		}
	}
	cout << sum << endl;
	return 0;
}