#include<bits/stdc++.h>
using namespace std;
constexpr int M=1<<19,G=3,mod1=998244353,mod2=1004535809;
constexpr int G1=(mod1+1)/3,G2=(mod2+1)/3,inv=669690699;
typedef long long LL;
vector<int>e;bool vis[M],buc[M];
vector<LL>vec[M];LL ans;
int n,q,l,x,lim,p[M],rev[M];
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x;
}
int rdc1(int x){return x>=mod1?x-mod1:x;}
int rdc2(int x){return x>=mod2?x-mod2:x;}
struct Int{ int x,y;
	friend Int operator +(Int a,Int b){return (Int){rdc1(a.x+b.x),rdc2(a.y+b.y)};}
	friend Int operator -(Int a,Int b){return (Int){rdc1(a.x+mod1-b.x),rdc2(a.y+mod2-b.y)};}
	friend Int operator *(Int a,Int b){return (Int){1ll*a.x*b.x%mod1,1ll*a.y*b.y%mod2};}
	LL ans(){return 1ll*(y-x+mod2)%mod2*inv%mod2*mod1+x;}
}a[M],b[M];
int qpow(int x,int n,int mod){
	int s=1;while (n){
		if (n&1) s=1ll*s*x%mod;
		x=1ll*x*x%mod;n>>=1;
	} return s;
}
void NTT(Int *a,int type){
	for (int i=0;i<lim;i++)
		if (rev[i]>i) swap(a[rev[i]],a[i]);
	for (int i=1;i<lim;i<<=1){
		Int Wn=(Int){qpow(type?G:G1,mod1/(i<<1),mod1),qpow(type?G:G2,mod2/(i<<1),mod2)};
		for (int j=0;j<lim;j+=i<<1){ Int w=(Int){1,1};
			for (int k=0;k<i;w=w*Wn,k++){
				Int x=a[j+k],y=a[i+j+k]*w;
				a[j+k]=x+y;a[i+j+k]=x-y;		
			}
		}
	}
}
void solve(int n){
	for (int i=0;i<n;i++) b[i]=a[i+n]=a[i];
	reverse(b,b+n);l=-1;lim=1;
	while (lim<=n*3) lim<<=1,l++;
	for (int i=0;i<lim;i++) rev[i]=rev[i>>1]>>1|(i&1)<<l;
	NTT(a,1);NTT(b,1);
	for (int i=0;i<lim;i++) a[i]=a[i]*b[i];
	NTT(a,0);Int inv=(Int){qpow(lim,mod1-2,mod1),qpow(lim,mod2-2,mod2)};
	for (int i=0;i<lim;i++) a[i]=a[i]*inv;
}
void clear(){for (int i=0;i<lim;i++) a[i]=b[i]=(Int){0,0};}
int main(){
	n=read();q=read();
	for (int i=1;i<=n;i++) p[i]=read();
	for (int i=1;i<=n;i++)
		if (!vis[i]){ int m=0;
			for (int j=i;!vis[j];j=p[j]) a[m++]={j,j},vis[j]=1;solve(m);
			if (!buc[m]) buc[m]=1,e.push_back(m),vec[m].resize(m);
			for (int i=0;i<m;i++) vec[m][i]+=a[i+m-1].ans(); clear();
		}
	while (q--){
		x=read();ans=0;
		for (auto t:e)
			ans+=vec[t][x%t];
		printf("%lld\n",ans);
	}
	return 0;
}