#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"

using namespace std;
const long long int MOD = 1000000007;

long long int i[3000000];
long long int j[3000000];

long long int N;
string s[100001];
int si[100001];
long long int M, x, d;
long long int ans;
vector<long long int>sum[100001];

int main() {
	ios::sync_with_stdio(false);
	cin >> N;
	for (int i = 1; i <= N; i++) {
		cin >> s[i];
		si[i] = (int)s[i].size();
		sum[i].resize(si[i]);
		sum[i][0] = MOD*(int)(s[i][0] - 'a') + (26 - s[i][0] - 'a');
		for (int j = 1; j < si[i]; j++) {
			sum[i][j] = sum[i][j - 1] * (int)(s[i][j] - 'a' + 37) + (43 - (s[i][j] - 'a'));
		}
		//for (int j = 0; j < si[i]; j++)cout << sum[i][j] << " ";
		//cout << endl;
	}
	cin >> M >> x >> d;
	for (int k = 0; 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));
	}
	for (int k = 0; k < M; k++) {
		int l = -1;
		int r = min(si[i[k]], si[j[k]]) ;
		while (r - l>1) {
			int mid = (r + l) / 2;
			if (sum[i[k]][mid] == sum[j[k]][mid])l = mid;
			else r = mid ;
		}
		ans += l + 1;
		//cout << ans << endl;
	}
	cout << ans << endl;

	return 0;
}