#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)

using ll = long long;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

ll N;
string Ss[100100];
vector<ll> hs[2][100100];
const ll P = 33455171ll, Q = 252521011ll, MOD = 1111110001ll;

void generateHash(const ll p, vector<ll> (&hs)[100100]){
    for(int i=0;i<N;++i){
        int l = Ss[i].size();
        hs[i].resize(l);

        ll x = 0;
        for(int j=0;j<l;++j){
            x = (Ss[i][j] + x * p % MOD) % MOD;
            hs[i][j] = x;
        }
    }
}

int calc(int i, int j){
    if(Ss[i][0] != Ss[j][0]){return 0;}
    if(Ss[i].size() > Ss[j].size()){swap(i, j);}
    
    int l = Ss[i].size(), res = -1;
    for(int k=0;k<2;++k){
        int lb = 0, ub = l;
        while(ub - lb > 1){
            int mid = (lb + ub) / 2;
            if(hs[k][i][mid] == hs[k][j][mid]){lb = mid;}
            else{ub = mid;}
        }

        if(res == -1 || lb + 1 < res){
            res = lb + 1;
        }
    }

    return res;
}

int main(){
    std::cin >> N;

    for(int i=0;i<N;++i){
        std::cin >> Ss[i];
    }

    generateHash(P, hs[0]);
    generateHash(Q, hs[1]);

    ll M, x, d;
    std::cin >> M >> x >> d;

    ll res = 0;
    for(int _=0;_<M;++_){
        ll i, j;
        i = (x / (N - 1)) + 1;
        j = (x % (N - 1)) + 1;
        if (i > j){
            swap(i, j);
        }else{
            j = j + 1;
        }
        x = (x + d) % (N * (N - 1));
        
        res += calc(i - 1, j - 1);
    }

    std::cout << res << std::endl;
}