14年省赛K题：www

#define N 100005
int vis[N],num[N];
const int mod=1000000007;
int o;
int n,m,g,A,B;
int a[105],b[105];
LL ans[105];
vector<int > aa;
map<int,int > ma;
int dp[105][8000];
LL pow(LL a,LL n,LL mod)
{   LL res=1;
    while (n)
        {   if (n&1) res=res*a%mod;
            n>>=1;
            a=a*a%mod;
        }
    return res;
}

inline LL gcd(LL x,LL y){return x%y==0?y:gcd(y,x%y);}
inline LL lcm(LL x,LL y){if (x==0||y==0) return x+y;
                         return x/gcd(x,y)*y;
                        }
void doit()
{
    scanf("%d%d%d%d%d",&n,&A,&B,&m,&g);
    if (m==1)
        {
            printf("%d\n",0);return;
        }
    a[0]=1;b[0]=1;
    for (int i=1;i<=n;i++)
        {   a[i]=a[i-1]*A%99991;
            b[i]=b[i-1]*B%99991;
        }
    for (int i=1;i<=n;i++)
        {
            b[i]%=a[i];ans[i]=1;
            LL t,s,w;
            for (int j=0;j<o;j++)
            {   s=0;
                t=num[j];w=a[i];     while (t<=w) {s+=w/t;t*=num[j];}
                t=num[j];w=b[i];     while (t<=w) {s-=w/t;t*=num[j];}
                t=num[j];w=a[i]-b[i];while (t<=w) {s-=w/t;t*=num[j];}
                ans[i]*=pow(num[j],s,m);
                ans[i]%=m;
            }
            //printf("%d %lld\n",i,ans[i]);
        }

    aa.clear();
    for (int i=1;i<N;i++)
        {if (i*i>g) break;
         if (g%i!=0)continue;
         aa.pb(i);
         if (i!=g/i)aa.pb(g/i);
        }
    sort(aa.begin(),aa.end());
    ma.clear();
    int id=0;
    for (int i=0;i<aa.size();i++)ma[aa[i]]=id++;

ans[1]=ans[2]=0;ans[3]=4;
    memset(dp,0,sizeof(dp));
    dp[0][0]=1;
    for (int i=0;i<n;i++)
    for (int j=0;j<id;j++)if (dp[i][j])
        {
            LL re=lcm(ans[i+1],aa[j]);
            if (re>g) re=gcd(re,g);
            dp[i+1][ma[re]]+=dp[i][j];
            dp[i+1][ma[re]]%=mod;
            dp[i+1][j]+=dp[i][j];
            dp[i+1][j]%=mod;
        }

    printf("%d\n",(dp[n][id-1]+mod)%mod);
}

void pre()
{
    memset(vis,0,sizeof(vis));
    for (int i=2;i<N;i++)if (!vis[i])
    for (int j=i+i;j<N;j+=i)
    vis[j]=1;
    o=0;
    for (int i=2;i<N;i++) if (!vis[i])
        num[o++]=i;
}
int main()
{   pre();
    int cas;
    scanf("%d",&cas);
    while (cas--) doit();
}
/*
2
10 2 1 1000000000 1
100 154 5495 924716080 14716
*/