#include "bits/stdc++.h"

#ifdef WINT_MIN
#define __MAI
#endif

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 
// #define getchar_unlocked _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;
        }
        int c() { return getchar_unlocked(); }
        MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
    };
}
MaiScanner scanner;

// 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;
// }
inline int lcp(ull l1, ull l2) {
    if ((l1 & 0xff00000000000000ll) != (l2 & 0xff00000000000000ll))
        return 0;
    if ((l1 & 0x00ff000000000000ll) != (l2 & 0x00ff000000000000ll))
        return 1;
    if ((l1 & 0x0000ff0000000000ll) != (l2 & 0x0000ff0000000000ll))
        return 2;
    if ((l1 & 0x000000ff00000000ll) != (l2 & 0x000000ff00000000ll))
        return 3;
    if ((l1 & 0x00000000ff000000ll) != (l2 & 0x00000000ff000000ll))
        return 4;
    if ((l1 & 0x0000000000ff0000ll) != (l2 & 0x0000000000ff0000ll))
        return 5;
    if ((l1 & 0x000000000000ff00ll) != (l2 & 0x000000000000ff00ll))
        return 6;
    return 7 + ((l1 & 0x00000000000000ffll) == (l2 & 0x00000000000000ffll));
}

inline int lcp(pair<int, vector<ll>>& s1, pair<int, vector<ll>>& s2) {
    size_t vs = min(s1.second.size(), s2.second.size()) - 1;
    size_t i = 0;
    for (; s1.second[i] == s2.second[i] && i < vs; ++i) {}
    return min(min(s1.first, s2.first), (int)(i*8 + lcp(s1.second[i], s2.second[i])));
}

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

// string str[100010];

pair<int, vector<ll>> llstr[100010];

unordered_map<ll, int> mark;

// 119714

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

    scanner >> n; scanner.c();
    repeat(n) {
        ll c, count = 0;
        ll e=0;
        int& sz = llstr[cnt].first = 0;
        vector<ll>& v = llstr[cnt].second;
        v.reserve(800);
        while ((c = scanner.c()) != '\n') {
            e = (e << 8ll) | c;
            if ((++count & 7) == 0){
                v.push_back(e);
                e = 0;
            }
        }
        sz = count;
        while ((count++ & 7)){e <<=8ll;}
        v.push_back(e);
        v.push_back(0); // 若干オーバーランするため余分を追加
        //scanner.c();
    }
    scanner >> m >> x >> d;

    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));
        ll key = (l << 32) | r;
        if (mark.count(key)) {
            result += mark[key];
        }
        else {
            result += mark[key] = lcp(llstr[l], llstr[r]);
        }
    }
    cout << result << endl;
    return 0;
}