#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#include <random>
#include <unordered_map>
using namespace std;

#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

int const MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-12;
int INF = INT_MAX / 2;

int main() {
	int N; cin >> N;
	vector<string> s(N);
	rep(i, N) cin >> s[i];
	int M; ll x, d;
	cin >> M >> x >> d;
	unordered_map<ll, int> mp;
	ll ans = 0;
	while (M--) {
		int i = x / (N - 1), j = x % (N - 1);
		if (i > j) swap(i, j);
		else j++;
		if (!mp.count(x)) {
			int k;
			for (k = 0; k < s[i].length() && k < s[j].length() && s[i][k] == s[j][k]; k++);
			mp[x] = k;
		}
		ans += mp[x];
		x = (x + d) % (N * (N - 1));
	}
	cout << ans << endl;
}