#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define loop(i,a,b) for(i=a;i<b;i++)
#define rloop(i,a,b) for(i=a;i>=b;i--)
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
const int inf=1000000001;
const ll INF=1e16;
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846

int main(){
	int n,i,j,k,l,x,d,m;
	cin>>n;
	vs s(n+1);
	loop(k,1,n+1){
		cin>>s[k];
	}
	vii dp(n+1,vi(n+1,-1));
	cin>>m>>x>>d;
	ll sum=0;
	loop(k,1,m+1){
		int cnt=0;
		i=(x/(n-1))+1;
		j=(x%(n-1))+1;
		if(i>j){
			swap(i,j);
		}else{
			j++;
		}
		if(dp[i][j]==-1){
			loop(l,0,min(s[i].size(),s[j].size())){
				if(s[i][l]==s[j][l]){
					cnt++;
				}else{
					break;
				}
			}
			dp[i][j]=cnt;
		}
		x=(x+d)%(n*(n-1));
		sum+=dp[i][j];
	}
	cout<<sum<<endl;
}