def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    
    idx = 0
    N = int(data[idx])
    idx += 1
    K = int(data[idx])
    idx += 1
    Q = int(data[idx])
    idx += 1
    S = data[idx]
    idx += 1
    queries = list(map(int, data[idx:idx+Q]))
    
    is_palindrome = S == S[::-1]
    
    if is_palindrome:
        for A in queries:
            x = A
            r_boundary = min(x - 1, K * N - x)
            print(2 * r_boundary + 1)
    else:
        N_val = N
        r_infinite = [0] * N_val
        for pos in range(N_val):
            r = 0
            while True:
                left = (pos - (r + 1)) % N_val
                right = (pos + (r + 1)) % N_val
                if S[left] == S[right]:
                    r += 1
                else:
                    break
            r_infinite[pos] = r
        
        for A in queries:
            x = A
            pos_in_S = (x - 1) % N_val
            r = r_infinite[pos_in_S]
            r_boundary = min(x - 1, K * N_val - x)
            ans = 2 * min(r, r_boundary) + 1
            print(ans)

if __name__ == '__main__':
    main()