#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 SparseTable
{
private:
    vector<int> logTable;
    vector<vector<int> > data;
public:
    SparseTable(const vector<int>& v){
        int n = v.size();
        logTable.assign(n+1, 0);
        for(int i=2; i<=n; ++i)
            logTable[i] = logTable[i>>1] + 1;

        data.assign(1, v);
        for(int i=1; (1<<i)<=n; ++i){
            int len = 1 << i;
            data.push_back(vector<int>(n - len + 1));
            for(int j=0; j<n-len+1; ++j)
                data[i][j] = min(data[i-1][j], data[i-1][j+len/2]);
        }
    }
    int query(int a, int b){
        int i = logTable[b-a+1];
        int len = 1 << i;
        return min(data[i][a], data[i][b-len+1]);
    }
};

int main()
{
    int n;
    cin >> n;
    vector<pair<string, int> > v(n);
    for(int i=0; i<n; ++i){
        cin >> v[i].first;
        v[i].second = i;
    }
    sort(v.begin(), v.end());
    vector<int> index(n);
    for(int i=0; i<n; ++i)
        index[v[i].second] = i;

    vector<int> len(n-1, 0);
    for(int i=0; i<n-1; ++i){
        int maxLen = min(v[i].first.size(), v[i+1].first.size());
        while(len[i] < maxLen && v[i].first[len[i]] == v[i+1].first[len[i]])
            ++ len[i];
    }
    SparseTable st(len);

    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;
    for(int i=0; i<m; ++i){
        int a2 = index[a[i]];
        int b2 = index[b[i]];
        if(a2 > b2)
            swap(a2, b2);
        ans += st.query(a2, b2 - 1);
    }
    cout << ans << endl;

    return 0;
}