#include #include #include #include int N; std::vector s; std::vector i, j; int M; size_t x, d; int comp(std::string s1, std::string s2) { int d = 0; int l = std::min(s1.size(), s2.size()); for (int k = 0; k < l; k++) { if (s1[k] != s2[k]) { break; } d++; } //std::cout << d << std::endl; return d; } int main() { size_t r = 0; std::cin >> N; s.resize(N); for (int k = 0; k < N; k++) { std::cin >> s[k]; } std::cin >> M >> x >> d; i.resize(M); j.resize(M); for (int k = 0; k < M; k++) { i[k] = (x / (N - 1)) + 1; j[k] = (x % (N - 1)) + 1; if (i[k] > j[k]) { std::swap(i[k], j[k]); } else { j[k] = j[k] + 1; } x = (x + d) % (N * (N - 1)); } for (int k = 0; k < M; k++) { //std::cout << i[k] << j[k] << std::endl; r += comp(s[i[k]-1], s[j[k]-1]); } std::cout << r << std::endl; }