// #define DEBUGGING #include #define endl '\n' #define ALL(V) (V).begin(), (V).end() #define ALLR(V) (V).rbegin(), (V).rend() template using V = std::vector; template using VV = V>; using ll = std::int64_t; using ull = std::uint64_t; using PLL = std::pair; using TLL = std::tuple; template const T& var_min(const T &t) { return t; } template const T& var_max(const T &t) { return t; } template const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); } template const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); } template void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); } template void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); } template const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); } template void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); } namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; } #define mv_rec make_v(init, tail...) template T make_v(T init) { return init; } template auto make_v(T init, size_t s, Tail... tail) { return V(s, mv_rec); } #undef mv_rec #ifdef DEBUGGING #include "../../debug/debug.cpp" #else #define DEBUG(...) 0 #define DEBUG_SEPARATOR_LINE 0 #endif using namespace std; V manacher(const string &S) { ll i = 0, j = 0; V ret(S.size()); while(i < S.size()) { for(; 0 <= i - j && i + j < S.size() && S[i - j] == S[i + j]; j++); ret[i] = j; ll k = 1; for(; 0 <= i - k && i + k < S.size() && k + ret[i - k] < j; k++) ret[i + k] = ret[i - k]; i += k; j -= k; } return ret; } int main() { ll N, K, Q; cin >> N >> K >> Q; bool small = K < 3; string S; cin >> S; string SS; for(ll i = 0; i < min(3, K); i++) SS += S; auto len = manacher(SS); ll all_len = S.size() * K; while(Q--) { ll a; cin >> a; a--; if(small) { cout << len[a] * 2 - 1 << endl; continue; } ll aidx = a % S.size() + S.size(); if(len[aidx] == aidx + 1 || aidx + len[aidx] == S.size() * 3) { ll r = min(a + 1, all_len - a); cout << r * 2 - 1 << endl; } else { cout << len[aidx] * 2 - 1 << endl; } } return 0; }