import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(1000005) 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-(-1 << 63) # md = 10**9+7 md = 998244353 class SparseTable: def __init__(self, op, e, aa): self.op = op self.e = e self.w = w = len(aa) self.h = h = w.bit_length() table = [aa]+[[e() for _ in range(w)] for _ in range(h-1)] tablei1 = table[0] for i in range(1, h): tablei = table[i] for j in range(w-(1 << i)+1): rj = j+(1 << (i-1)) tablei[j] = op(tablei1[j], tablei1[rj]) tablei1 = tablei self.table = table # [l,r)の取得 def prod(self, l, r): if l == r: return self.e() i = (r-l).bit_length()-1 tablei = self.table[i] return self.op(tablei[l], tablei[r-(1 << i)]) # ok(prod(l,r))=Trueとなる最大r def max_right(self, l, ok): for i in range(self.h)[::-1]: if l+(1 << i) > self.w: continue if ok(self.table[i][l]): l += 1 << i return l # ok(prod(l,r))=Trueとなる最小l def min_left(self, r, ok): for i in range(self.h)[::-1]: l = r-(1 << i) if l < 0: continue if ok(self.table[i][l]): r = l return r from collections import defaultdict n = II() ss = [None]*n for i in range(n): ss[i] = [ord(c)-96 for c in SI()]+[0] lcp = [-1]*n lr = [(0, n)] ii = list(range(n)) j = 0 while lr: plr, lr = lr, [] c2i = defaultdict(list) for l, r in plr: for p in range(l, r): i = ii[p] c = ss[i][j] c2i[c].append(i) for i in c2i[0]: ii[l] = i if lcp[l-1] == -1: lcp[l-1] = j l += 1 for c in sorted(c2i): d = len(c2i[c]) if d > 1: lr.append((l, l+d)) if lcp[l-1] == -1: lcp[l-1] = j for i in c2i[c]: ii[l] = i l += 1 j += 1 # print(lcp) # print(ii) sp = SparseTable(min, lambda: 400000, lcp) i2p = [0]*n for p, i in enumerate(ii): i2p[i] = p m, x, d = LI() ans=0 for _ in range(m): i = x//(n-1) j = x%(n-1) if i > j: i, j = j, i else: j += 1 p,q=i2p[i],i2p[j] ans+=sp.prod(p, q) x = (x+d)%(n*(n-1)) print(ans)