#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;
struct SuffixArray{
	int n, k;
	vector<int> rk, tmp, sa;
	string s;
	SuffixArray(string s):n(s.size()), s(s), rk(s.size()+1), tmp(s.size()+1), sa(s.size()+1){
		auto compare_sa=[&](int i, int j){
			if(rk[i]!=rk[j]) return rk[i]<rk[j];
			else{
				int ri, rj;
				if(i+k<=n) ri=rk[i+k];
				else ri=-1;
				if(j+k<=n) rj=rk[j+k];
				else rj=-1;
				return ri<rj;
			}
		};
		for(int i=0; i<=n; i++){
			sa[i]=i;
			if(i<n){
				rk[i]=s[i]-'A';
			}else{
				rk[i]=-1;
			}
		}
		for(k=1; k<=n; k<<=1){
			sort(sa.begin(), sa.end(), compare_sa);
			tmp[sa[0]]=0;
			for(int i=1; i<=n; i++){
				tmp[sa[i]]=tmp[sa[i-1]];
				if(compare_sa(sa[i-1], sa[i])) tmp[sa[i]]++;
			}
			rk=tmp;
		}
	}
	int operator[](const int &k) const{
		return sa[k];
	}
};
int main()
{
	int n, q;
	ll m;
	cin>>n>>m>>q;
	string s;
	cin>>s;
	if(m==1){
		SuffixArray sa(s);
		while(q--){
			ll k; cin>>k;
			cout<<sa[k]+1<<" ";
		}
		cout<<endl;
		return 0;
	}
	ll c=0;
	SuffixArray sa(s+s);
	ll x[200020];
	x[0]=0;
	for(int i=1; i<=2*n; i++){
		x[i]=x[i-1]+((sa[i]<n)?(m-1):1);
	}
	while(q--){
		ll k; cin>>k;
		int j=lower_bound(x, x+2*n+1, k)-x;
		ll ans;
		if(sa[j]>=n){
			ans=sa[j]-n+n*(m-1)+1;
		}else{
			ans=n*(x[j]-k)+1+sa[j];
		}
		cout<<ans<<" ";
	}
	cout<<endl;
	return 0;
}