import re, itertools, bisect
n, m, q = map(int, input().split())
s = input()
K = map(int, input().split())
s = re.fullmatch('(.+?)\1*', s).group(1)
n, m = len(s), n//len(s)*m
s *= 2
T = sorted(range(n*2), key = lambda i: s[i:])
J = [0] + list(itertools.accumulate(m-1 if t<n else 1 for t in T))
R = []
for k in K:
	k -= 1
	h = bisect.bisect(J, k)-1
	R += [1 + T[h] + n*(m-2-(k-J[h]))]
print(*R)