#include<bits/stdc++.h>
using namespace std;
const int N=800010;
int t[N][26];
int cnt;
vector<int>id[N];
string s[N];
void insert(string s,int idd){
	int root=0,len;
	for(int i=0;i<s.size();i++){
		int x=s[i]-'a';
		if(!t[root][x])t[root][x]=++cnt;
		root=t[root][x];
		id[idd].push_back(root);
	}
	return;
}
long long n;
long long m,x,d;
long long ans;
long long cal(int a,int b){
	int res=0;
	int l=1,r=min((int)s[a].size(),(int)s[b].size()),mid;
	while(l<=r){
		mid=(l+r)>>1;
		if(id[a][mid-1]==id[b][mid-1]){
			res=mid;
			l=mid+1;
		}
		else r=mid-1; 
	}
	return res;
}
signed main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>s[i];
		insert(s[i],i);
	}
	cin>>m>>x>>d;
	while(m--){
		long long a=x/(n-1)+1;
		long long b=x%(n-1)+1;
		if(a>b)swap(a,b);
		else b++;
//		cerr<<a<<" "<<b<<"\n";
		ans+=cal(a,b);
		x=(x+d)%(n*(n-1));
	}
	cout<<ans<<"\n";
	return 0;
}