全RE求调

#include <stdio.h>
#include <stdlib.h>

char nums[10000010] = {0};
int Prime[8000000] = {0};

void E_sieve(int n){
    nums[0] = 1;
    nums[1] = 1;
    int idx = 0;
    for(int i = 2;i <= n;i++){
        if(!nums[i]){
            Prime[idx++] = i;
        }
        //内层循环用以遍历已确定是质数的数组
        for(int j = 0; j < idx && 1LL*i*Prime[j] <= n*1LL;j++){
            nums[Prime[j]*i] = 1;
            if(i%Prime[j] == 0){
                break;
            }
        }
    }
}

int main(){
    int n,q,k;
    scanf("%d%d",&n,&q);
    E_sieve(n);
    while(q--){
        scanf("%d",&k);
        printf("%d\n",Prime[k-1]);
    }
    return 0;
}