#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
const ll MOD=1e9+7;

ll m[2],r[2];
class Hash{
public:
  string s;
  int n;
  vector<ll> powr[2],hash[2];
  Hash(string str){

    n=str.size();
    rep(i,2){
      hash[i].resize(n+1);
      powr[i].resize(n+1); powr[i][0]=1;
    }
    rep(i,n)rep(j,2){
      powr[j][i+1]=powr[j][i]*r[j]%m[j];
      hash[j][i+1]=(hash[j][i]*r[j]%m[j]+str[i])%MOD;
    }
  }
  pll v(int l,int r){ //[l,r)
    if(l>r)return pll(0,0);
    ll re[2];
    rep(i,2)
      re[i]=(hash[i][r]+m[i]-(hash[i][l]*powr[i][r-l]%m[i]))%m[i];
    return pll(re[0],re[1]);
  }
  pll v(int r){
    return pll(hash[0][r],hash[1][r]);
  }
};

int main(){
  srand(time(NULL));
  rep(i,2){
    r[i]=rand()*2+11;  m[i]=1e9+rand()%100;
  }
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  ll n;
  cin>>n;
  vector<string> ss(n);
  rep(i,n) cin>>ss[i];
  vector<Hash> hshs(all(ss));
  ll m,x,d;
  ll re=0;
  cin>>m>>x>>d;
  //vv<pii> qs(n);
  rep(i,m){
    int l=x/(n-1)+1;
    int r=x%(n-1)+1;
    if(l>r) swap(l,r);
    else ++r;
    //out(l,r,x,1);
    x=(x+d)%(n*(n-1));

    --l; --r;
    //qs[l].eb(r,i);
    int a=0,b=min(ss[l].size(),ss[r].size())+1;
    while(b-a>1){
      int m=(a+b)/2;
      if(hshs[l].v(m)==hshs[r].v(m)) a=m;
      else b=m;
    }
    re+=a;
  }
  cout<<re<<endl;
  return 0;
}