素数筛

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
const int M=1e6+11;
typedef long long ll;
const int mod=998244353;
ll p,l,r,k,cnt;
ll pre[M],a[M],num[M];
bool book[M];
void init()
{
    p=0;
    for(int i=2; i<M; i++)
    {
        if(!book[i])
        {
            pre[p++]=i;
            for(int j=i*2; j<M; j+=i)
                book[j]=1;
        }
    }
}