#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;
#define il inline
#define gc getchar()
#define t(i) edge[i].to
#define mp make_pair
#define ri register int
#define rb register bool
#define rc register char
#define lb(x) lower_bound(st+1,st+st_cnt,x)-st
#define rp(i,x,y) for(ri i=x;i<=y;++i)
#define my(i,x,y) for(ri i=x;i>=y;--i)
#define e(i,x) for(ri i=head[x];i;i=edge[i].nxt)
const int N=1e6+10,mod=1000000007,M=50000;
int n,q,p,v[N],w[N],poww[N]={1},divv[N],div_cnt,id1[M],id2[M],s[M],f[M];
il int read()
{
rc ch=gc;ri x=0;rb y=1;
while(ch!='-' && (ch<'0' || ch>'9'))ch=gc;
if(ch=='-')ch=gc,y=0;
while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^'0'),ch=gc;
return y?x:-x;
}
il int gcd(ri gd,ri gs){return gs?gcd(gs,gd%gs):gd;}
il int ask_id(ri x){return x<=M?id1[x]:id2[p/x];}
int main()
{
//     freopen("4495.in","r",stdin);//freopen("4495.out","w",stdout);
n=read();q=read();p=read();rp(i,1,n)v[i]=gcd(read(),p);rp(i,1,n)poww[i]=(poww[i-1]<<1)%mod;
for(ri i=1;i*i<=p;++i)if(!(p%i)){divv[++div_cnt]=i;if(i*i!=p)divv[++div_cnt]=p/i;}
sort(divv+1,divv+1+div_cnt);rp(i,1,div_cnt)if(divv[i]<=M)id1[divv[i]]=i;else id2[p/divv[i]]=i;
rp(i,1,n)++s[ask_id(v[i])];
my(i,div_cnt,1)
{
ri tmp1=s[i],tmp2=0;
rp(j,i+1,div_cnt)if(!(divv[j]%divv[i]))tmp2=(tmp2+f[j])%mod,tmp1+=s[j];
f[i]=(poww[tmp1]-1-tmp2+mod)%mod;
}
my(i,div_cnt,1)
rp(j,1,i-1)if(!(divv[i]%divv[j]))f[i]=(f[i]+f[j])%mod;
while(q--)printf("%d\n",f[ask_id(gcd(read(),p))]);
return 0;
}