import sys
from itertools import permutations
from heapq import heappop,heappush
from collections import deque
import random
import bisect

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())




mod = 10**9 + 7
N = 10**7 + 100
inverse = [1]*(N+1)

for i in range( 2, N + 1 ):
    inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
inverse[0]=0

N,K,M = mi()
assert K == 2
X = li()

f = [0] * (N+1)
f[0],f[1] = 1,2*N
for n in range(2,N+1):
    f[n] = (2*N*f[n-1] % mod + (n-2) * f[n-2] % mod) % mod
    f[n] = f[n] * inverse[n] % mod

res = [f[N-i]*(i*inverse[N] % mod) % mod for i in range(N+1)]

for k in range(M):
    print(res[X[k]])