【模板】线性筛素数

#include<bits/stdc++.h>
using namespace std;
#define LL long long
const int N = 1e8 + 10;
int p[N],cnt,vis[N];
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int n,q;
	cin >> n>>q;
	for (int i = 2; i <= n; i++) {
		if (!vis[i]) p[++cnt] = i;
		for (int j = 1;1LL* i * p[j] <= n; j++) {
			int m = i * p[j];
			vis[m] = 1;
			if (i % p[j]==0) break;//保证每个合数是被最小质因子划掉
		}
	}
	while (q--) {
		int k;
		cin >> k;
		cout << p[k] << '\n';
	}
	return 0;
}