import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.Collections; import java.util.Comparator; import java.util.NoSuchElementException; class Main { int N, M; int[] X, Y; int[] pow2 = new int[30]; public static void main(String[] args) { new Main().run(); } void run() { for (int i = 0; i < pow2.length; ++i) { pow2[i] = 1 << i; } Scanner sc = new Scanner(); long N = sc.nextLong(); String[] s = new String[(int) N]; TrieByList trie = new TrieByList((int) N); for (int i = 0; i < N; ++i) { s[i] = sc.next(); trie.add(s[i].toCharArray(), i); } long t = System.currentTimeMillis(); trie.preLca(); SparseTable st = new SparseTable(trie.A); long M = sc.nextLong(); long x = sc.nextLong(); long d = sc.nextLong(); long ans = 0; long nn = N * (N - 1); for (int k = 0; k < M; ++k) { int i = (int) (x / (N - 1)) + 1; int j = (int) (x % (N - 1)) + 1; if (i > j) { int tmp = i; i = j; j = tmp; } else { j = j + 1; } x = (x + d) % nn; --i; --j; if (trie.pos[trie.rev[i]] > trie.pos[trie.rev[j]]) { int tmp = i; i = j; j = tmp; } ans += st.query(trie.pos[trie.rev[i]], trie.pos[trie.rev[j]] + 1); } System.out.println(ans); // System.out.println(System.currentTimeMillis() - t); } class SparseTable { int[][] t; public SparseTable(int[] A) { int N = A.length; t = new int[(int) (Math.log(N) / Math.log(2) + 1)][]; t[0] = new int[(int) N]; for (int i = 0; i < N; ++i) { t[0][i] = A[i]; } for (int i = 1; i < t.length; ++i) { int p = N - pow2[i]; t[i] = new int[p]; for (int j = 0; j < p; ++j) { t[i][j] = Math.min(t[i - 1][j], t[i - 1][j + pow2[i - 1]]); } } } int query(int l, int r) { int a = f(r - l); return Math.min(t[a][l], t[a][r - pow2[a]]); } } // 1< 1) { int m = (h + l) / 2; if (pow2[m] <= ciel) { l = m; } else { h = m; } } return l; } class TrieByList { Node root = new Node(0, (char) -1); int gen = 1; int[] A; int[] pos; int[] rev; public TrieByList(int N) { rev = new int[N]; Arrays.fill(rev, -1); } class Node { int id; char c; Node[] child = null; int ptn = 0; int p = 0; int hit = 0; int depth = -Integer.MAX_VALUE / 16; public Node(int id, char c) { this.id = id; this.c = c; } Node search(char c) { if (ptn << 31 - (c - 'a') < 0) { return child[Integer.bitCount(ptn << 31 - (c - 'a')) - 1]; } else { return null; } } void append(Node n) { if (p == 0) { child = new Node[1]; } else if (p + 1 > child.length) { child = Arrays.copyOf(child, child.length * 2); } int zind = Integer.bitCount(ptn << 31 - (n.c - 'a')); System.arraycopy(child, zind, child, zind + 1, p - zind); child[zind] = n; ptn |= 1 << (n.c - 'a'); ++p; } } void add(char[] s, int id) { Node pre = null; Node cur = root; for (char c : s) { pre = cur; cur = pre.search(c); if (cur == null) { cur = new Node(gen++, c); pre.append(cur); } } ++cur.hit; rev[id] = cur.id; } void preLca() { A = new int[4 * gen]; pos = new int[gen]; Arrays.fill(pos, -1); root.depth = 0; dfs(root); } int tmp = 0; void dfs(Node cur) { if (pos[cur.id] == -1) { pos[cur.id] = tmp; } A[tmp++] = cur.depth; for (int i = 0; i < cur.p; ++i) { A[tmp++] = cur.depth; cur.child[i].depth = cur.depth + 1; dfs(cur.child[i]); A[tmp++] = cur.depth; } A[tmp++] = cur.depth; } } class Scanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } private void skipUnprintable() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; } public boolean hasNext() { skipUnprintable(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } }