P3383有没有用Python的大佬改进一下QAQ 全部TLE

a,b=map(int,input().split())
z=[]
maxl=a
count = 0       
ss = []  
check = []
for x in range(0, maxl+1):
	check.append(0)
for i in range(2, maxl):
	if check[i] == 0:
		ss.append(i)
		count += 1
	for j in range(0, count):
		if ss[j]*i > maxl:
			break
		check[ss[j]*i] = 1
 
		if i%ss[j] == 0:
			break

for x in range(0,b):
        z=int(input())
        print(ss[z-1])