#include <bits/stdc++.h>
using namespace std;

// RMQ<int> rmq(114514);
template<typename V> struct RMQ {
	private:
	int n;
	vector<V> node;
	public:
	RMQ(int sz) {
		n=1;while(n<sz)n*=2;
		node.resize(2*n-1,1145141919);
	}
	void update(int x, V val) {
		x+=n-1,node[x]=val;
		while(x>0) x=(x-1)/2,node[x]=min(node[2*x+1],node[2*x+2]);
	}
	V q(int a, int b, int k=0, int l=0, int r=-1) {
		if(r<0) r=n;
		if(r<=a||b<=l) return 1145141919;
		if(a<=l&&r<=b) return node[k];
		return min(q(a,b,2*k+1,l,(l+r)/2),q(a,b,2*k+2,(l+r)/2,r));
	}
};

int n, m, r[114514];
long long x, d, ans;
string s[114514];
vector<pair<string,int>> p;
RMQ<int> lcp(114514);

int main() {
	cin >> n;
	for (int i = 0; i < n; ++i) {
		cin >> s[i];
		p.push_back({s[i],i});
	}
	
	sort(p.begin(), p.end());
	for (int i = 0; i < n-1; ++i) r[p[i].second] = i;
	for (int i = 0; i < n-1; ++i) {
		int j = 0;
		for (; j < min(p[i].first.size(), p[i+1].first.size()); ++j) {
			if (p[i].first[j]!=p[i+1].first[j]) break;
		}
		lcp.update(i,j);
	}
	
	cin >> m >> x >> d;
	for (int i = 1; i <= m; ++i) {
		int a = x/(n-1) + 1, b = x%(n-1) + 1;
		if (a>b) swap(a,b);
		else b++;
		x = (x+d) % (n*(n-1));
		//cout << a << ' ' << b << ' ' << lcp.q(r[a-1],r[b-1]) << endl;
		int inc = lcp.q(r[a-1],r[b-1]);
		if (inc!=1145141919) ans += inc;
	}
	cout << ans << endl;
}