#pragma GCC optimize ("O3") #pragma GCC target ("avx") #include "bits/stdc++.h" #ifdef WINT_MIN #define __MAI #endif using namespace std; typedef unsigned int uint; typedef long long int ll; typedef unsigned long long int ull; #define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout< ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<=l;--cnt) #define BIGINT 0x7FFFFFFF #define MD 1000000007ll #define PI 3.1415926535897932384626433832795 void printbit(int u) { if (u == 0)cout << 0; else { int s = 0, k = 0; for (; 0>= 1, k++)s = (s << 1) | (u & 1); for (; 0>= 1)cout << (s & 1); } }template ostream& operator <<(ostream &o, const pair p) { o << "(" << p.first << ":" << p.second << ")"; return o; } #define TIME chrono::system_clock::now() #define MILLISEC(t) (chrono::duration_cast(t).count()) namespace { std::chrono::system_clock::time_point t; void tic() { t = TIME; } void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - t)); } std::chrono::system_clock::time_point tle = TIME; //#ifdef __MAI void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); } //#else //#define safe_tle(k) ; //#endif } #ifdef __MAI //_getchar_nolock #define getchar_unlocked getchar #endif namespace { class MaiScanner { public: template void input_integer(T& var) { var = 0; T sign = 1; int cc = getchar_unlocked(); for (; cc<'0' || '9'>(int& var) { input_integer(var); return *this; } inline MaiScanner& operator>>(long long& var) { input_integer(var); return *this; } }; } MaiScanner scanner; template class sparse_table { public: int size; vector log2; vector data; vector dp; sparse_table(int size) :size(size), log2(size + 1), data(size) { // for fast calculate log2 for (int i = 2; i <= size; ++i) { log2[i] = log2[i >> 1] + 1; } dp.resize(size*(log2[size] + 1)); } inline T& operator[](size_t i) {return data[i]; } inline T operator[](size_t i)const { return data[i]; } void build() { int l, i, f, b; for (i = 0; i < size; i++) { dp[i] = i; } for (l = 1; (1 << l) <= size; l++) { for (i = 0; i + (1 << l) <= size; i++) { f = dp[i + size*(l - 1)]; b = dp[(i + (1 << (l - 1))) + size*(l - 1)]; dp[i + size*l] = (data[f] <= data[b]) ? f : b; // minimum } } } // range [l,r] T queryIdx(int l, int r) const { int lg = log2[r - l + 1]; int i1 = dp[l + size*lg]; int i2 = dp[r - (1 << lg) + 1 + size*lg]; return (data[i1] <= data[i2]) ? i1 : i2; // minimum } }; inline int lcp(string& s1, string& s2) { int s = min(s1.size(), s2.size()); int i; for (i = 0; s1[i] == s2[i] && i < s; ++i) {} return i; } int width, height; ll m, n, kei; string str[100010]; int warp[100010]; int rwarp[100010]; int main() { ll x, d; ll l, r; int c; // scanner >> n; scanner.c(); // // repeat(n) { // str[cnt].reserve(400); // while ((c = scanner.c()) != '\n') // str[cnt].push_back(c); // // warp[cnt] = cnt; // } // scanner >> m >> x >> d; cin >> n; repeat(n) { cin >> str[cnt]; warp[cnt] = cnt; } cin >> m >> x >> d; sort(warp, warp + n, [](int l, int r) {return str[l] < str[r]; }); sparse_table st(n); fill(ALL(st.data),999999); repeat(n - 1) { rwarp[warp[cnt]] = cnt; st[cnt] = lcp(str[warp[cnt]], str[warp[cnt + 1]]); } rwarp[warp[n - 1]] = n - 1; st.build(); ll result = 0; for (ll k = 1; k <= m; ++k) { l = (x / (n - 1)); r = (x % (n - 1)); if (l > r) swap(l, r); else { r = r + 1; } x = (x + d) % (n * (n - 1)); l = rwarp[l]; r = rwarp[r]; if (l > r) result += st[st.queryIdx(r, l - 1)]; else result += st[st.queryIdx(l, r - 1)]; } cout << result << endl; return 0; }