LCM LCM

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (100000009)
#define IS(A) ((cn[A>>6]>>(A&63))&1)
#define ST(A) (cn[A>>6]|=1ULL<<((A&63)))
ll cn[1+(MX>>6)];
void gen(){
    ST(0),ST(1);
    int Q(1+sqrt(MX));
    for(ll i(4);i<MX;i+=2)ST(i);
    for(int k(3);k<=Q;k+=2)if(!IS(k))
        for(ll h(k<<1),j(k*k);j<MX;j+=h)ST(j);
}
ll S=1,h;
int T,M,O[MX],I=2,X,J;
ii A[MX];
set<ii> Q;
int main(void){
    gen();
    scanf("%d%d",&T,&M);
    F(T)scanf("%d",&A[i].aa),A[i].bb=i;
    sort(A,A+T),X=A[T-1].aa+1;
    while(J<T){
        if(A[J].aa<I){
            O[A[J++].bb]=S;continue;
        }
        if(!Q.empty()&&(*Q.begin()).aa==I){
            S*=(*Q.begin()).bb,Q.erase(Q.begin()),S%=M;continue;
        }
        if(IS(I)){++I;continue;}
        S*=I,h=I,S%=M;
        while((h*=I)<=X)Q.insert({h,I});
        ++I;
    }
    F(T)printf("%d\n",O[i]);
    return 0;
}