# coding: utf-8
import array, bisect, collections, copy, heapq, itertools, math, random, re, string, sys, time

sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    N = II()
    s = [str(input()) for __ in range(N)]
    M, x, d = ILI()
    return (N, s, M, x, d)


def makeQuery(N, M, x, d):
    query = []
    for k in range(M):
        i = (x // (N - 1)) + 1
        j = (x % (N - 1)) + 1
        if i > j:
            i, j = j, i
        else:
            j += 1
        query.append((i - 1, j - 1))
        x = (x + d) % (N * (N - 1))
    return query


def solve(N, s, M, x, d):
    query = makeQuery(N, M, x, d)
    s_sorted = sorted(s)
    d_ind_sort = collections.defaultdict(int)
    for ind, str in enumerate(s_sorted):
        d_ind_sort[str] = ind
    l_lcp = []
    for i in range(N - 1):
        str_1 = s_sorted[i]
        str_2 = s_sorted[i + 1]
        count = 0
        for char_1, char_2 in zip(str_1, str_2):
            if char_1 != char_2:
                break
            count += 1
        l_lcp.append(count)

    ans = 0
    for q in query:
        str_1 = s[q[0]]
        str_2 = s[q[1]]
        sorted_ind_1 = d_ind_sort[str_1]
        sorted_ind_2 = d_ind_sort[str_2]
        ind_min = min(sorted_ind_1, sorted_ind_2)
        ind_max = max(sorted_ind_1, sorted_ind_2)
        lcp = min(l_lcp[ind_min:ind_max])
        ans += lcp

    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()