#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)



typedef long long ll;
int N, M, X, D, I[3010101], J[3010101];
string S[101010];
//-----------------------------------------------------------------
void init() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> N;
    rep(i, 0, N) cin >> S[i];
    cin >> M >> X >> D;

    ll x = X, d = D;
    rep(i, 0, M) {
        I[i] = (x / (N - 1));
        J[i] = (x % (N - 1));
        if (I[i] > J[i]) swap(I[i], J[i]);
        else J[i]++;
        x = (x + d) % (1LL * N * (N - 1));
    }
}
//-----------------------------------------------------------------
map<int, int> memo[101010];
int calc(int a, int b) {
    if (memo[a].count(b)) return memo[a][b];

    int cnt = 0;
    rep(i, 0, min(S[a].length(), S[b].length())) {
        if (S[a][i] == S[b][i]) cnt = i + 1;
        else break;
    }

    return memo[a][b] = cnt;
}
//-----------------------------------------------------------------
int main() {
    init();

    ll ans = 0;
    rep(i, 0, M) {
        int a = I[i], b = J[i];
        ans += calc(a, b);
    }
    cout << ans << endl;
}