#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

class RollingHash
{
private:
    static const int X[], M[];
    vector<vector<long long> > xp;
    vector<vector<long long> > hash;
public:
    RollingHash(const string& s){
        int n = s.size();
        xp.assign(n+1, vector<long long>(2, 1));
        hash.assign(n+1, vector<long long>(2, 0));
        for(int i=0; i<n; ++i){
            for(int j=0; j<2; ++j){
                hash[i+1][j] = hash[i][j];
                hash[i+1][j] *= X[j];
                hash[i+1][j] += s[i];
                hash[i+1][j] %= M[j];
                xp[i+1][j] = xp[i][j];
                xp[i+1][j] *= X[j];
                xp[i+1][j] %= M[j];
            }
        }
    }
    pair<long long, long long> getHash(int a, int b) const{
        vector<long long> ans(2);
        for(int i=0; i<2; ++i){
            ans[i] = hash[b+1][i];
            ans[i] -= hash[a][i] * xp[b-a+1][i];
            ans[i] %= M[i];
            if(ans[i] < 0)
                ans[i] += M[i];
        }
        return make_pair(ans[0], ans[1]);
    }
};
const int RollingHash::X[] = {1685440109, 1389328937, 1813126193}; // 素数
const int RollingHash::M[] = {2000000087, 2000000089, 2000000099}; // 合同式の法（素数）

int solve(int len, const RollingHash& a, const RollingHash& b)
{
    int left = 0;
    int right = len;
    while(left < right){
        int mid = (left + right + 1) / 2;
        if(a.getHash(0, mid-1) != b.getHash(0, mid-1))
            right = mid - 1;
        else
            left = mid;
    }
    return left;
}

int main()
{
    int n;
    cin >> n;
    vector<string> s(n);
    for(int i=0; i<n; ++i)
        cin >> s[i];

    vector<RollingHash> rh;
    for(int i=0; i<n; ++i)
        rh.push_back(RollingHash(s[i]));

    int m;
    long long x, d;
    cin >> m >> x >> d;
    vector<int> a(m), b(m);
    for(int i=0; i<m; ++i){
        a[i] = (int)(x / (n - 1));
        b[i] = (int)(x % (n - 1));
        if(a[i] > b[i])
            swap(a[i], b[i]);
        else
            ++ b[i];
        x = (x + d) % (n * (n - 1LL));
    }

    long long ans = 0;
    map<pair<int, int>, int> memo;
    for(int i=0; i<m; ++i){
        pair<int, int> key(a[i], b[i]);
        if(memo.find(key) != memo.end()){
            ans += memo[key];
        }
        else{
            int len = min(s[a[i]].size(), s[b[i]].size());
            int tmp = solve(len, rh[a[i]], rh[b[i]]);
            ans += tmp;
            memo[key] = tmp;
        }
    }
    cout << ans << endl;

    return 0;
}