import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

base = 34
mod = 9999971

def hash_arr(s):
    h = 0
    hh = [0]*(len(s)+1)
    for i, c in enumerate(s):
        c = ord(c)-97
        h = (h*base+c)%mod
        hh[i+1] = h
    return hh

n = II()
ss = []
for _ in range(n): ss.append(hash_arr(SI()))
m, x, d = LI()

ans = 0
for _ in range(m):
    i = (x//(n-1))+1
    j = (x%(n-1))+1
    if i > j:
        i, j = j, i
    else:
        j += 1
    x = (x+d)%(n*(n-1))

    si = ss[i-1]
    sj = ss[j-1]
    l, r = 0, min(len(si), len(sj))
    while l+1 < r:
        c = (l+r)//2
        if si[c] == sj[c]:
            l = c
        else:
            r = c
    ans += l

print(ans)