#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

int main(){
	int n;
	cin >> n;
	vector<string> s(n);
	rep(i, n) cin >> s[i];
	//rep(i, n) cout << s[i] << endl;
	ll ans = 0LL;
	map<pii, int> mp;
	int m;
	ll x, d;
	cin >> m >> x >> d;
	rep(k, m) {
		int i = (x / (n-1)) + 1;
		int j = (x % (n-1)) + 1;
		if(i > j) swap(i, j);
		else j++;
		x = (x+d) % ((ll)n*(n-1LL));

		i--;
		j--;
		if(mp.count({i, j})) ans += mp[{i, j}];
		else {
			int len = min(s[i].size(), s[j].size());
			int tmp = len;
			rep(idx, len) {
				if(s[i][idx] != s[j][idx]) {
					tmp = idx;
					break;
				}
			}
			ans += tmp;
			mp[{i, j}] = tmp;
		}
		//cout << " " << i << " " << j  << " " << mp[{i, j}] << endl;
	}
	cout << ans << endl;
}