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

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;


const int MAX_LOG = 20;
class SparseTable{
private:
  int n;
  VI dat[MAX_LOG];
  VI logTable;
public:
  SparseTable(int n, const VI& xs): n(n)
  {
	logTable.resize(n+1);
	logTable[0] = logTable[1] = 0;
	for(int i=2;i<=n;++i)
	  logTable[i] = logTable[i>>1] + 1;
	
	dat[0] = xs;
	for(int i=1;i<MAX_LOG;++i){
	  dat[i].resize(n);
	  for(int j=0;j<n;++j)
		dat[i][j] = min(dat[i-1][j], dat[i-1][min(n-1, j + (1<<(i-1)))]);
	}
  }

  // RMQ [l,r)
  int query(int l, int r){
	int d = logTable[r - l];
	return min(dat[d][l], dat[d][r - (1<<d)]);
  }
};

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  LL N; cin >> N;
  vector<pair<string,int>> vs(N);
  REP(i,N){
	cin >> vs[i].FF;
	vs[i].SS = i;
  }
  SORT(vs);
  VI tab(N);
  REP(i,N) tab[vs[i].SS] = i;

  VI lens(N);
  REP(i,N-1){
	int lcp = 0;
	int s1 = SZ(vs[i].FF);
	int s2 = SZ(vs[i+1].FF);
	while(lcp < s1 && lcp < s2 && vs[i].FF[lcp] == vs[i+1].FF[lcp])
	  ++lcp;
	lens[i] = lcp;
  }

  SparseTable st(N, lens);
  LL ans = 0;
  LL M, X, D;
  cin >> M >> X >> D;
  for(LL k=1;k<=M;++k){
	PLL q = MP(X / (N-1), X % (N-1));
	if(q.FF > q.SS)
	  swap(q.FF, q.SS);
	else
	  q.SS++;
	X = (X + D) % (N * (N-1));

	int l = tab[q.FF];
	int r = tab[q.SS];
	if(l > r) swap(l,r);
	ans += st.query(l, r);
  }

  cout << ans << endl;

  return 0;
}