#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h"

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define repeat(l) for(auto cnt=0;cnt<(l);++cnt)
#define upto(l,r) for(auto cnt=l;cnt<=r;++cnt)
#define downto(r,l) for(auti cnt=r;cnt>=l;--cnt)
#define BIGINT 0x7FFFFFFF
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
void printbit(int u) { if (u == 0)cout << 0; else { int s = 0, k = 0; for (; 0<u; u >>= 1, k++)s = (s << 1) | (u & 1); for (; 0<k--; s >>= 1)cout << (s & 1); } }template<typename T1, typename T2>
    ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

namespace {
    std::chrono::system_clock::time_point t;
    void tic() { t = TIME; }
    void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - t)); }
    std::chrono::system_clock::time_point tle = TIME;
    //#ifdef __MAI
    void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); }
    //#else
    //#define safe_tle(k) ;
    //#endif
}

#ifdef __MAI //_getchar_nolock
#define getchar_unlocked getchar
#endif
namespace {
    class MaiScanner {
    public:
        template<typename T>
        void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
    };
}
MaiScanner scanner;


// Segment tree
// T       : プリミティブ型推奨。vectorで色々したい場合はインデックス番号やポインタを使う。
// idt     : 無効な値を表す。
// Compare : 区間最小であればstd::less。
// segtree(size) : データ数。勝手に2のべき乗サイズになる。
template<typename T, T idt = 0x7FFFFFFF>
class segtree {
    size_t size;
    //vector<T> data;
    T data[300010];

public:

    segtree(size_t n) {
        size = 1;
        while (size<n) size <<= 1;
        //data.resize(size * 2);
    }

    //void fill(const T& e) {
    //    std::fill(data.begin(), data.end(), e);
    //}

    const T& operator[](size_t index) const {
        return data[size - 1 + index];
    }

    void update(size_t index, const T& e) {
        index += size - 1;
        data[index] = e;
        while (0 < index) {
            index = (index - 1) / 2; // 親へ移動
            data[index] = min(data[index * 2 + 1], data[index * 2 + 2]); // iの子を参照して、d[i]を更新する
        }
    }

    inline T query(size_t begin, size_t end, size_t ptr, size_t rangebegin, size_t rangeend) {

        if (rangeend <= begin || end <= rangebegin) return idt;
        if (begin <= rangebegin && rangeend <= end) return data[ptr];

        // size_t rangemid = (rangebegin + rangeend) / 2;
        return min(query(begin, end, ptr * 2 + 1, rangebegin, (rangebegin + rangeend) / 2), query(begin, end, ptr * 2 + 2, (rangebegin + rangeend) / 2, rangeend));
    }
    inline T query(size_t begin, size_t end) {
        return query(begin, end, 0, 0, size);
    }

};

inline int lcp(string& s1, string& s2) {
    int s = min(s1.size(), s2.size());
    int i;
    for (i = 0; s1[i] == s2[i] && i < s; ++i) {}
    return i;
}

int width, height;
ll m, n, kei;

string str[100010];

int warp[100010];
int rwarp[100010];

int main() {
    ll x, d;
    ll l, r;
    int c;

    scanner >> n; scanner.c();

    repeat(n) {
        str[cnt].reserve(40);
        while ((c = scanner.c()) != '\n')
            str[cnt].push_back(c);

        warp[cnt] = cnt;
    }
    scanner >> m >> x >> d;

    sort(warp, warp + n, [](auto l, auto r) {return str[l] < str[r]; });

    segtree<int> st(n);

    repeat(n - 1) {
        rwarp[warp[cnt]] = cnt;
        st.update(cnt, lcp(str[warp[cnt]], str[warp[cnt + 1]]));
    }
    rwarp[warp[n - 1]] = n - 1;

    ll result = 0;
    for (ll k = 1; k <= m; ++k) {
        l = (x / (n - 1));
        r = (x % (n - 1));
        if (l > r)
            swap(l, r);
        else {
            r = r + 1;
        }
        x = (x + d) % (n * (n - 1));

        l = rwarp[l];
        r = rwarp[r];
        if (l > r)
            result += st.query(r, l);
        else
            result += st.query(l, r);

    }
    cout << result << endl;
    return 0;
}