#include <bits/stdc++.h>

using namespace std;

using ll = long long;

template <class SemiLattice>
struct SparseTable {
    using T = typename SemiLattice::T;

    int n;
    vector< vector<T> > table;
    vector<int> log_table;

    SparseTable() {}
    SparseTable(const vector<T>& v) {
        n = v.size();

        log_table.resize(n + 1, 0);
        for (int i = 2; i <= n; i++) {
            log_table[i] = log_table[i >> 1] + 1;
        }

        table.resize(log_table[n] + 1, vector<T>(n));
        for (int i = 0; i < n; i++) {
            table[0][i] = v[i];
        }

        size_t sz = table.size();
        for (int i = 1; i < sz; i++) {
            for (int j = 0; j + (1 << i) <= n; j++) {
                table[i][j] = SemiLattice::merge(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);
            }
        }
    }

    //区間[l, r)に対するクエリに答える
    T query(int l, int r) {
        assert(l < r);
        int k = log_table[r - l];
        return SemiLattice::merge(table[k][l], table[k][r - (1 << k)]);
    }
};

//以下、SemiLatticeの例
template <class U = ll>
struct RMQSL {
    using T = U;
    static T merge(T a, T b) { return min(a, b); }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<string> s(n);
    vector<int> ids(n);
    for (int i = 0; i < n; i++) {
        cin >> s[i];
        ids[i] = i;
    }
    sort(ids.begin(), ids.end(), [&](const int i1, const int i2){return s[i1] < s[i2];});

    vector<int> lcp(n, 0);
    for (int i = 0; i < n - 1; i++) {
        int i1 = ids[i], i2 = ids[i + 1];
        int sz = min(s[i1].size(), s[i2].size());

        lcp[i] = sz;
        for (int j = 0; j < sz; j++) {
            if (s[i1][j] != s[i2][j]) {
                lcp[i] = j;
                break;
            } 
        }
    }

    vector<int> rev(n, 0);
    for (int i = 0; i < n; i++) rev[ids[i]] = i;

    SparseTable< RMQSL<int> > st(lcp);

    int m;
    ll x, d;
    cin >> m >> x >> d;
    ll ans = 0;
    for (int k = 1; k <= m; k++) {
        ll i = (x / (n - 1)) + 1;
        ll j = (x % (n - 1)) + 1;
        if (i > j) swap(i, j);
        else j++;

        i = rev[i - 1];
        j = rev[j - 1];
        if (i > j) swap(i, j);
        ans += st.query(i, j);

        x = (x + d) % ((ll)n * (n - 1));
    }
    cout << ans << "\n";
    return 0;
}