#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL n, m, x, d;
pair<string, int> p[100000];
int rev[100000];

const int BS = 1 << 17;
int a[2 * BS];

LL lcp(int i, int j) {
	int c = 0;
	inc(k, min(p[i].FI.size(), p[j].FI.size())) {
		if(p[i].FI[k] == p[j].FI[k]) { c++; } else { break; }
	}
	return c;
}

int rmq(int i, int j) {
	int v = BS;
	
	if(i >= j) { return v; }
	if(i + 1 == j) { return a[i]; }
	
	if(i % 2 == 1) { setmin(v, a[i]); }
	if(j % 2 == 1) { setmin(v, a[j - 1]); }
	
	return min(v, rmq((i + 1) / 2, j / 2));
}

int main() {
	cin >> n;
	inc(i, n) { cin >> p[i].FI; p[i].SE = i; }
	cin >> m >> x >> d;
	
	sort(p, p + n);
	inc(i, n) { rev[ p[i].SE ] = i; }
	inc(i, 2 * BS) { a[i] = BS; }
	inc(i, n - 1) { a[BS + i] = lcp(i, i + 1); }
	dec(i, BS) { a[i] = min(a[i * 2], a[i * 2 + 1]); }
	
	/*
	int A, B;
	cin >> A >> B;
	cout << rmq(BS + A, BS + B) << endl;
	
	int g = BS, h = 0;
	inc1(i, BS * 2 - 1) {
		inc(j, g) { cout << (a[i] == 32 ? -1 : a[i]); h++; }
		if(h % BS == 0) { cout << endl; g /= 2; }
	}
	inc(i, BS) { cout << i % 10; } cout << endl;
	
	*/
	
	LL i, j, ans = 0;
	inc(k, m) {
		i = (x / (n - 1));
		j = (x % (n - 1));
		if(i > j) { swap(i, j); } else { j++; }
		x = (x + d) % (n * (n - 1));
		
		ans += rmq(BS + rev[i], BS + rev[j]);
	}
	
	cout << ans << endl;
	
	return 0;
}