//Let's join Kaede Takagaki Fan Club !!
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
template<class T>
void dmp(T a){
	rep(i,a.size()) cout << a[i] << " ";
	cout << endl;
}
template<class T>
bool chmax(T&a, T b){
	if(a < b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
bool chmin(T&a, T b){
	if(a > b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 1000000007;//998244353
template<class T>
void add(T&a,T b){
	a+=b;
	if(a >= mod) a-=mod;
}


int NN,k;
int ran[400005];
int tmp[400005];
int sa[400005];

bool compare_sa(int i,int j)
{
	if(ran[i] != ran[j]) return ran[i] < ran[j];
	else
	{
		int ri = i+k<=NN ? ran[i+k]: -1;
		int rj = j+k<=NN ? ran[j+k]: -1;
		
		return ri < rj;
	}
}

void construct_sa(string S)
{
	NN = S.size();
	for(int i=0;i<=NN;i++)
	{
		sa[i] = i;
		ran[i] = i<NN?S[i]:-1;
	}
	
	for(k=1;k<=NN;k*=2)
	{
		sort(sa,sa+NN+1,compare_sa);
		
		tmp[sa[0]] = 0;
		for(int i=1;i<=NN;i++)
		{
			tmp[sa[i]] = tmp[sa[i-1]] + compare_sa(sa[i-1],sa[i]);
		}
		for(int i=0;i<=NN;i++)
		{
			ran[i] = tmp[i];
		}
	}
}
int lcp[400005];
void construct_lcp(string S)
{
	int n = S.size();
	for(int i=0;i<=n;i++) ran[sa[i]] = i;
	
	int h = 0;
	lcp[0] = 0;
	
	for(int i=0;i<n;i++)
	{
		int j = sa[ran[i]-1];
		
		if(h) h--;
		for(;j+h<n && i+h<n;h++)
		{
			if(S[j+h] != S[i+h]) break;
		}
		lcp[ran[i]-1] = h;
	}
}

string s;
ll n,m,q;
ll ans[100005];
ll ans2[100005];

string reduce(string str){
	int sz = str.size();
	for(int i=1;i<=sz;i++){
		if(sz%i != 0) continue;
		string ret = str.substr(0, i);
		for(int j=i;j<sz;j++){
			if(str[j-i] != str[j]) goto fail;
		}
		return ret;
		fail:;
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin >> n >> m >> q;
	cin >> s;
	s = reduce(s);
	m *= n/s.size();
	n = s.size();
	//cout << n << " " << m << endl;
	if(m > 4){
		int n = s.size();
		s = s+s+s+s;
		construct_sa(s);
		construct_lcp(s);
		ll cur = 0;
		rep(i,100005) ans2[i] = -1;
		
		map<ll,int>M;
		vector<pair<ll,int>>vec;
		for(int i=1;i<=4*n;i++){
		    //cout << sa[i]%n << " " << (sa[i] < 3*n?1:0) << endl;
			if(sa[i] >= 3*n){
				M[++cur] = sa[i]%n;
			}
			else if(ans2[sa[i]%n] == -1){
				//answer for n*(m-2)+sa[i]%n
				ans2[sa[i]%n] = 1;
				vec.pb(mp(++cur, sa[i]%n));
				cur += (m-2);
			}
		}
		rep(i,q) {
			ll a; g(a);
			if(M.find(a) != M.end()){
				o(1LL*(m-1)*n + M[a] + 1, (i==q-1?0:1));
			}
			else{
				int x = POSL(vec, mp(a, INF));
				x--;
				assert(vec[x].fi <= a && a <= vec[x].fi+m-2);
				int id = vec[x].sc;
				o(1LL*(m-2)*n+id - 1LL*n*(a-vec[x].fi) + 1, (i==q-1?0:1));
			}
		}
	}
	else{
		string t = "";
		rep(i,m) t += s;
		construct_sa(t);
		construct_lcp(t);
		rep(i,q) {
			int a; g(a); o(1+sa[a], (i==q-1?0:1)); 
		}
	}
}