#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define mod 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)

void manacher(const string& S,vector<int>& res)
{
    int sz = (int)S.size(), i = 0, j = 0, k;
    res.resize(sz);
    while(i < sz){
        while(i-j >= 0 && i+j < sz && S[i-j] == S[i+j]) j++;
        res[i] = j, k = 1;
        while(i-k >= 0 && i+k < sz && k+res[i-k] < j){
            res[i+k] = res[i-k], k++;
        }
        i += k; j -= k;
    }
}

int main(){
    ll n,k,q;
    cin >> n >> k >> q;
    string s;
    cin >> s;
    if(k==1){
        vector<int> p;
        manacher(s,p);
        rep(i,q){
            ll a;
            cin >> a;
            a--;
            cout << 2*p[a]-1 << "\n";
        }
    }else{
        s = s+s+s;
        ll len = n*k;
        vector<int> p;
        manacher(s,p);    
        int m = s.size();
        rep(i,q){
            ll a;
            cin >> a;
            a--;
            if(a<n){
                cout << 2*p[a]-1 << "\n";
            }else if(a >= len-n){
                a -= n*(k-1);
                cout << 2*p[2*n+a]-1 << "\n";
            }else{
                ll b = a%n;
                b+=n;
                ll L = b;
                ll R = 3*n-b;
                ll t = p[b];
                if(t==L||t==R){
                    cout << min(2*a+1,2*(len-a)-1) << "\n";
                }else{
                    cout << 2*t-1 << "\n";
                }
            }
        }
    }
    return 0;
}