/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author aajisaka
 */

#include<bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SPEED ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

using ll = long long;
using P = pair<ll, ll>;

constexpr double PI = 3.14159265358979323846;
mt19937_64 engine(chrono::steady_clock::now().time_since_epoch().count());

class Tapristaberu {

    // return R[i]: The length of the longest palindrome where
    // the center is S[i]. Obviously, R[0] = R[S.size()] = 1;
    // If you would like to find palindromes whose length are even,
    // add dummy characters in S.
    void manacher(string& S, vector<int>& R) {
      int i = 0, j = 0;
      while (i < S.size()) {
        while (i-j >= 0 && i+j < S.size() && S[i-j] == S[i+j]) ++j;
        R[i] = j;
        int k = 1;
        while (i-k >= 0 && i+k < S.size() && k+R[i-k] < j) R[i+k] = R[i-k], ++k;
        i += k; j -= k;
      }
    }


public:
    void solve(istream& cin, ostream& cout) {
      SPEED;
      ll n, k, q; cin >> n >> k >> q;
      string s; cin >> s;
      string sss = s + s + s;
      vector<int> r(3*n);
      manacher(sss, r);
      while(q--) {
        ll a; cin >> a;
        a--;
        ll p = a%n+n;
        ll ans = r[p];
        if (ans > n) {
          ans = LLONG_MAX;
        }
        chmin(ans, k*n-a);
        chmin(ans, a+1);
        cout << ans*2-1 << '\n';
      }

    }
};

signed main() {
  Tapristaberu solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}