#include <bits/stdc++.h>

#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
int dx_ori[4] = { -1,0, 1,0 }, dy_ori[4] = { 0,1,0,-1 };
int dx[4] = {0, 0, 0, 0}, dy[4] = {0, 0, 0, 0};
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

class Manacher {
public:
  string s, t;
  vi a;

  Manacher (string s): s(s) {
    rep (i, s.size()) {
      t.push_back(s[i]);
      if (i != s.size() - 1) t.push_back('?');
    }
    a.resize(t.size());
    int i = 0, j = 0;
    while (i < t.size()) {
      while (i-j >= 0 && i+j < t.size() && t[i-j] == t[i+j]) ++j;
      a[i] = j;
      int k = 1;
      while (i-k >= 0 && i+k < t.size() && k+a[i-k] < j) a[i+k] = a[i-k], ++k;
      i += k; j -= k;
    }
  }

  // 文字iを中心とする回文の長さ
  int length(int i) {
    int len_ori = 2*a[2*i] - 1;
    if (len_ori % 4 == 1) return len_ori / 2 + 1;
    if (len_ori % 4 == 3) return len_ori / 2;
    assert(false);
  }

  // i, i+1を中心とする回文の長さ
  int length(int i, int j) {
    assert(j == i + 1);
    int len_ori = 2*a[2*i + 1] - 1;
    if (len_ori % 4 == 1) return len_ori / 2;
    if (len_ori % 4 == 3) return len_ori / 2 + 1;
    assert(false);
  }
};


signed main() {
  fio();
  ll n, k, q;
  cin >> n >> k >> q;
  string s;
  cin >> s;

  string t;
  rep (i, min(7LL, k)) t += s;
  Manacher man(t);

  //DEBUG(t);
  while (q--) {
    ll a;
    cin >> a;
    a--;
    if (k <= 7) {
      cout << man.length(a) << endl;
      continue;
    }
    int i = a % n;
    i += 3 * n;
    int max_len = min(2 * i + 1, (7*n - i - 1) * 2 + 1);
    if (man.length(i) < max_len) {
      cout << man.length(i) << endl;
    }
    else {
      cout << min(a, (k * n - a - 1) * 2 + 1) << endl;
    }
  }
}