#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<vector>


using namespace std;
using ll=long long;


vector<char*> s;
vector<vector<int> > dp;


void swap(int& a, int& b)
{
	int c;
	c=a;
	a=b;
	b=c;
}


int lcp(int i, int j)
{
	if(i<j) swap(i, j);

if(i<0 || j<0 || i>=dp.size())
{
	printf("Wrong number.\n");
	exit(0);
}
	if(j>=dp[i].size()) dp[i].resize(j+1, -1);
	else if(dp[i][j]>=0) return dp[i][j];

	char *p, *q;
	int k;

	p=s[i];
	q=s[j];
	for(k=0;p[k] && p[k]==q[k];k++)
		;
	return dp[i][j]=k;
}


int main(void)
{
	vector<char> buf;
	char *p;
	int i, j, k, n, m, d;
	ll x, result;

	while(scanf("%d", &n)==1)
	{
		dp.clear();
		dp.resize(n);
		s.resize(n);
		buf.resize(800000+100000);
		p=&buf[0];
		for(i=0;i<n;i++)
		{
			s[i]=p;
			scanf("%s", s[i]);
			p+=strlen(s[i])+1;
		}
		if(n<=1)
		{
			printf("%d\n", strlen(s[0]));
			continue;
		}

		result=0;
		scanf("%d%lld%d", &m, &x, &d);
		for(k=0;k<m;k++)
		{
			i=(x/(n-1))+1;
			j=(x%(n-1))+1;
			if(i>j) swap(i, j);
			else j++;
			x=(x+d)%((ll)n*(n-1));
			result+=lcp(i-1, j-1);
//			printf("k=%d  x=%d  i=%d  j=%d  %lld\n", k, x, i, j, result);
		}
		printf("%lld\n", result);
/*
for(auto x: dp)
{
	for(auto y: x) printf("%2d ", y);
	printf("\n");
}
*/
	}

	return 0;
}