#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return (int)p;}

const int iinf = 1e9;
const ll linf = 4e18;
const int mod1 = 1e9+7;
const int mod2 = 1e9+4437;
const int mod3 = 1e9+3999;
const int mod4 = 1e9+4437;
const double eps = 1e-10;

vl a[100005];
string s;
ll n, m, x, d;
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  FOR(i, 1, n+1){
    ll h1 = 0, h2 = 0;
    a[i].pb(0);
    cin >> s;
    FOR(j, 0, sz(s)){
      ll e = s[j] - 'a' + 1;
      h1 = (h1*27 + e)%mod1;
      h2 = (h2*27 + e)%mod2;
      a[i].pb(h1*mod2 + h2);
    }
  }
  cin >> m >> x >> d;
  ll nn = n * (n - 1), _i, _j, ans = 0;
  FOR(k, 1, m+1){
    _i = (x / (n - 1)) + 1;
    _j = (x % (n - 1)) + 1;
    if(_i > _j){
      swap(_i, _j);
    }else{
      _j++;
    }
    x = (x + d) % nn;
    ll l = 0, r = min(sz(a[_i]), sz(a[_j]));
    while(l + 1 < r){
      ll mid = (l+r)/2;
      if(a[_i][mid] == a[_j][mid]){
        l = mid;
      }else{
        r = mid;
      }
    }
    ans += l;
  }
  cout << ans << endl;
  return 0;
}