我们考虑一下只需要对每个数对P取gcd之后再考虑有多少个集合选出来的gcd是gcd(w,P)的约数,P的约数个数是1e3级的,所以可以直接预处理出答案
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
const int MAXN=1e6+10;
int fac[MAXN],sum[MAXN],p[MAXN],f[MAXN],ans[MAXN],v[MAXN];
int n,q,P,len,x;
map<int,int>mp;
int gcd(int x,int y){
int z=x%y;
while (z)
{
x=y; y=z; z=x%y;
}
return y;
}
void init(int x)
{
for (int i=1;i*i<=x;i++)
if (x%i==0)
{
p[++len]=i;
if (i*i!=x) p[++len]=x/i;
}
sort(p+1,p+len+1);
for (int i=1;i<=len;i++) mp[p[i]]=i;
for (int i=1;i<=n;i++) sum[mp[v[i]]]++;
fac[0]=1;
for (int i=1;i<=n;i++) fac[i]=(fac[i-1]*2)%mod;
for (int i=len;i>=1;i--)
{
int s=0;
for (int j=1;j<=len;j++)
if (p[j]%p[i]==0)
{
s+=sum[j];
}
f[i]=(fac[s]+mod-1)%mod;
for (int j=1;j<=len;j++)
if (p[j]%p[i]==0&&p[j]/p[i]>1) f[i]=(f[i]+mod-f[j])%mod;
}
for (int i=1;i<=len;i++)
{
for (int j=1;j<=i;j++)
if (p[i]%p[j]==0) ans[i]=(ans[i]+f[j])%mod;
}
}
int main()
{
scanf("%d%d%d",&n,&q,&P);
for (int i=1;i<=n;i++) scanf("%d",&v[i]),v[i]=gcd(v[i],P);
init(P);
for (int i=1;i<=q;i++)
{
scanf("%d",&x);
x=gcd(x,P);
printf("%d\n",ans[mp[x]]);
}
}