using System;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Extentions;

class IO
{
    int idx;
    string[] input;

    public IO(TextReader reader)
    {
        input = reader.ReadToEnd().Split(new[] { " ", "\n", "\r" },
            StringSplitOptions.RemoveEmptyEntries);
    }

    T Get<T>(Func<string, T> parser) => parser(input[idx++]);

    public string S => Get(s => s);
    public char C => Get(char.Parse);
    public int I => Get(int.Parse);
    public long L => Get(long.Parse);
    public double F => Get(double.Parse);
    public decimal D => Get(decimal.Parse);
    public BigInteger B => Get(BigInteger.Parse);

    T[] Gets<T>(int n, Func<string, T> parser)
        => input.Skip((idx += n) - n).Take(n).Select(parser).ToArray();

    public string[] Ss(int n) => Gets(n, s => s);
    public char[] Cs(int n) => Gets(n, char.Parse);
    public int[] Is(int n) => Gets(n, int.Parse);
    public long[] Ls(int n) => Gets(n, long.Parse);
    public double[] Fs(int n) => Gets(n, double.Parse);
    public decimal[] Ds(int n) => Gets(n, decimal.Parse);
    public BigInteger[] Bs(int n) => Gets(n, BigInteger.Parse);

    public void Write<T>(params T[] xs) => WriteLine(string.Join(" ", xs));
    public void Write(params object[] xs) => WriteLine(string.Join(" ", xs));
}

class SegmentTree
{
    int n;
    int[] tree;

    public SegmentTree(int n, int[] xs)
    {
        this.n = n;
        tree = new int[n * 2];
        for (var i = 0; i < n; i++)
            tree[i + n] = i < xs.Length ? xs[i] : int.MaxValue;
        for (var i = n - 1; i > 0; i--)
            tree[i] = Min(tree[i * 2], tree[i * 2 + 1]);
    }

    public void Update(int i, int x)
    {
        for (i += n; i > 0; i >>= 1)
            tree[i] = Min(tree[i * 2], tree[i * 2 + 1]);
    }

    public int Query(int i, int j)
    {
        var min = int.MaxValue;
        i += n;
        j += n;
        for (; i < j; i >>= 1, j >>= 1)
        {
            if ((j & 1) != 0) min = Min(min, tree[--j]);
            if ((i & 1) != 0) min = Min(min, tree[i++]);
        }
        return min;
    }
}

static class Extentions
{
    public static void Swap<T>(ref T x, ref T y)
    {
        var tmp = x;
        x = y;
        y = tmp;
    }
}

static class Program
{
    public static void Main()
    {
        var sw = new StreamWriter(OpenStandardOutput()) { NewLine = "\n" };
#if DEBUG
        sw.AutoFlush = true;
#else
        sw.AutoFlush = false;
#endif
        SetOut(sw);
        Solve(new IO(In));
        Out.Flush();
    }

    static int Lcp(string a, string b)
    {
        var cnt = 0;
        var len = Min(a.Length, b.Length);
        for (var i = 0; i < len; i++) if (a[i] == b[i]) cnt++; else break;
        return cnt;
    }

    static void Solve(IO io)
    {
        var n = io.I;
        var s = io.Ss(n);
        var m = io.I;
        var x = io.L;
        var d = io.L;

        var si = new int[n];
        for (var i = 0; i < n; i++) si[i] = i;
        Array.Sort(si, (a, b) => s[a].CompareTo(s[b]));
        Array.Sort(s);

        var lcplen = new int[n - 1];
        for (var i = 0; i < n - 1; i++) lcplen[i] = Lcp(s[i], s[i + 1]);

        var segtree = new SegmentTree(131072, lcplen);
        var ans = 0;

        for (var k = 0; k < m; k++)
        {
            var i = x / (n - 1) + 1;
            var j = x % (n - 1) + 1;
            if (i > j) Swap(ref i, ref j);
            else j = j + 1;

            var p = si[i - 1];
            var q = si[j - 1];
            if (p > q) Swap(ref p, ref q);
            var t = segtree.Query(p, q);
            ans += t;

            x = (x + d) % ((long)n * (n - 1));
        }

        io.Write(ans);
    }
}