RT，禁止无意义回复

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
const int maxm=1e7+5;
typedef long long ll;
int prime[maxm>>1];
int phi[maxm];
bool vis[maxm];
int a[maxn];
int l,r;
int cnt=0;
inline ll read()
{
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
    return x*f;
}
inline ll qpower(ll p,ll x,ll Mod)
{
    ll tmp=1;
    bool flag=0;
    if(p>=Mod){flag=1;p%=Mod;}
    while(x)
    {
        if(x&1)tmp=tmp*p;
        p=p*p;
        if(tmp>Mod){flag=1;tmp%=Mod;}
        if(p>Mod){flag=1;p%=Mod;}
        x>>=1;
    }
    return flag?tmp+Mod:tmp;
}
inline void get(int n)
{
    phi[1]=vis[1]=1;
    for(int i=2;i<=n;i++)
    {
        if(!vis[i])
        {
            cnt++;prime[cnt]=i;
            phi[i]=i-1;
        }
        for(int j=1;j<=cnt&&i*prime[j]<=n;j++)
        {
            vis[i*prime[j]]=1;
            if(i%prime[j]==0)
            {
                phi[i*prime[j]]=phi[i]*prime[j];
                break;
            }
            else phi[i*prime[j]]=phi[i]*phi[prime[j]];
        }
    }
}
inline ll query(int l,int r,int Mod)
{
    if(l==r||Mod==1)return a[l]>=Mod?a[l]%Mod+Mod:a[l];
    return qpower(a[l],query(l+1,r,phi[Mod]),Mod);
}
int n,m;
int Mod;
int main()
{
    n=read();Mod=read();
    get(maxm);
    for(int i=1;i<=n;i++)
    {
        a[i]=read();
    }
    m=read();
    for(int i=1;i<=m;i++)
    {
        l=read();r=read();
        printf("%lld\n",query(l,r,Mod)%Mod);
    }
}

眼瞎找不到错误/kk