local mfl, mce = math.floor, math.ceil
local mmi, mma = math.min, math.max
local bls, brs = bit.lshift, bit.rshift
local p2m1 = {1}
for i = 2, 25 do
  p2m1[i] = p2m1[i - 1] * 2
end

local n = io.read("*n", "*l")
local s = {}
local idx = {}
local idxinv = {}
for i = 1, n do
  s[i] = io.read()
  idx[i] = i
  idxinv[i] = 0
end
table.sort(idx, function(a, b) return s[a] < s[b] end)
for i = 1, n do
  idxinv[idx[i]] = i
end
local spt = {{}}
for i = 1, n - 1 do
  local s1 = s[idx[i]]
  local s2 = s[idx[i + 1]]
  local len = 0
  local n1, n2 = #s1, #s2
  while len < n1 and len < n2 and s1:byte(len + 1) == s2:byte(len + 1) do
    len = len + 1
  end
  spt[1][i] = len
end
do
  local len = 1
  for i = 2, 25 do
    spt[i] = {}
    for j = 1, n - 1 do
      if j + len <= n - 1 then
        spt[i][j] = mmi(spt[i - 1][j], spt[i - 1][j + len])
      else
        spt[i][j] = spt[i - 1][j]
      end
    end
    len = len * 2
  end
end

local sptpos = {}
local sptlen = {}
do
  local tmp = 1
  local pos = 1
  for len = 1, n - 1 do
    if tmp * 2 < len then
      tmp = tmp * 2
      pos = pos + 1
    end
    sptpos[len] = pos
    sptlen[len] = tmp
  end
end

local m, x, d = io.read("*n", "*n", "*n")
local ret = 0
for i = 1, m do
  local p = mfl(x / (n - 1)) + 1
  local q = (x % (n - 1)) + 1
  if q < p then
    p, q = q, p
  else
    q = q + 1
  end
  x = (x + d) % (n * (n - 1))
  
  local pi = idxinv[p]
  local qi = idxinv[q]
  if qi < pi then pi, qi = qi, pi end
  local pos = sptpos[qi - pi]
  ret = ret + mmi(spt[pos][pi], spt[pos][ qi - sptlen[qi - pi] ])
end
print(ret)
-- print(os.clock())