#include<string>
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
typedef long long int llint;
#define pub push_back
#define mp make_pair
#define fir first
#define sec second
const int big=((llint)1<<30);
const llint mod=1000000007;
//aabbaabb

//
int main(void){
	llint x,y,n,i,q,m,d,k,qx,qy,ans=0;
	vector<string> a;
	cin>>n;
	a.resize(n);
	for(i=0;i<n;i++){
		cin>>a[i];
	}
	cin>>m>>x>>d;
	for(k=1;k<=m;k++){
		qx=(x/(n-1));
		qy=(x%(n-1));
		if(qx>qy){swap(qx,qy);} else{qy++;}
		x=(x+d)%(n*(n-1));i=0;
		while(-1){
			if(a[qx].size()<=i||a[qx].size()<=i||a[qx][i]!=a[qy][i]){break;}
			ans++;i++;
		}
	}
	cout<<ans<<endl;
	return 0;
}