#include <iostream>
#include <map>

using namespace std;

int main(int argc, const char* argv[])
{
	uint64_t N;
	cin >> N;
	string S[N];
	for (auto&& c : S) cin >> c;
	int M, x, d;
	cin >> M >> x >> d;
	uint64_t i[M + 1];
	uint64_t j[M + 1];
	map<pair<int, int>, int> m;
	auto f = [&](int ik, int jk) {
		//	NOTE ik <= jk
		pair<int, int> key = {ik, jk};
		if (m[key]) return m[key];

		int cnt = 0;
		if (ik == jk) {
			cnt = S[ik].size();
		}
		else {
			for (int i = 0; i < S[ik].size() && i < S[jk].size(); i++) {
				if (S[ik][i] == S[jk][i])
					cnt++;
				else
					break;
			}
		}
		m[key] = cnt;
		return cnt;
	};

	for (int k = 1; k <= M; k++) {
		i[k] = (x / (N - 1)) + 1;
		j[k] = (x % (N - 1)) + 1;
		if (i[k] > j[k])
			swap(i[k], j[k]);
		else
			j[k] = j[k] + 1;

		x = (x + d) % (N * (N - 1));
	}
	int sum = 0;
	for (int k = 1; k <= M; k++) {
		int ik = i[k] - 1;
		int jk = j[k] - 1;
		sum += f(ik, jk);
	}
	cout << sum << endl;
	return 0;
}