#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
vector< int > manacher(const string &s) {
  vector< int > radius(s.size());
  int i = 0, j = 0;
  while(i < s.size()) {
    while(i - j >= 0 && i + j < s.size() && s[i - j] == s[i + j]) {
      ++j;
    }
    radius[i] = j;
    int k = 1;
    while(i - k >= 0 && i + k < s.size() && k + radius[i - k] < j) {
      radius[i + k] = radius[i - k];
      ++k;
    }
    i += k;
    j -= k;
  }
  return radius;
}
int main()
{
	int n;
	ll k;
	int q;
	cin>>n>>k>>q;
	string s;
	cin>>s;
	s=s+s+s;
	vector<int> v=manacher(s);
	for(int i=0; i<q; i++){
		ll a;
		cin>>a;
		a--;
		if(v[n+a%n]>=n){
			cout<<min(2*a+1, 2*(k*n-1-a)+1)<<endl;
		}else{
			cout<<min({2*a+1, 2*(k*n-1-a)+1, 2*(ll)v[n+a%n]-1})<<endl;
		}
	}
	return 0;
}