#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define LL __int128
#define MP make_pair
#define poly vector<long long>
mt19937 rnd(time(0));
const ll MOD1=998244353;
const ll MOD2=1004535809;
const LL v1=668514958533372747ll,v2=334257240187163831ll;
const int MAXN=1e6+5;
int bfly[MAXN]; 
template<const int MOD> void NTT(poly &F,int l,int typ){
	auto ksm=[&](ll a,int b){ll res=1;while(b){if(b&1)res=res*a%MOD;a=a*a%MOD,b>>=1;}return res;};
	for(int i=1;i<(1<<l);i++) bfly[i]=(bfly[i>>1]>>1)|((i&1)<<l-1);
	for(int i=0;i<(1<<l);i++) if(bfly[i]<i) swap(F[i],F[bfly[i]]);
	for(int i=1;i<=l;i++){
		ll step=ksm(3,(MOD-1)+((MOD-1)>>i)*typ);
		for(int j=0;j<(1<<l);j+=(1<<i)){
			ll cur=1;
			for(int k=j;k<(j|(1<<i-1));k++){
				ll u=F[k],v=F[k|(1<<i-1)]*cur%MOD;
				F[k]=(u+v)%MOD;F[k|(1<<i-1)]=(u-v+MOD)%MOD;
				cur=cur*step%MOD;
			}
		}
	}
	if(typ==-1){
		ll p=ksm(1<<l,MOD-2);
		for(int i=0;i<(1<<l);i++) F[i]=F[i]*p%MOD;
	}
	return;
};
template<const int MOD> poly prod(poly F,poly G){
	int n=F.size()+G.size()-1;
	int k=ceil(log2(n+1));
	F.resize(1<<k);G.resize(1<<k);
	NTT<MOD>(F,k,1);NTT<MOD>(G,k,1);
	for(int i=0;i<(1<<k);i++) F[i]=F[i]*G[i]%MOD;
	NTT<MOD>(F,k,-1);
	F.resize(n);
	return F;
}
poly operator *(poly F,poly G){
	poly H1=prod<MOD1>(F,G),H2=prod<MOD2>(F,G);
	poly H=H1;
	for(int i=0;i<H1.size();i++)
		H[i]=(H1[i]*v2+H2[i]*v1)%(MOD1*MOD2);
	return H;
}
int n,q;
int p[MAXN];bool vis[MAXN];
poly cyc,rcyc;
map<int,poly> mp; 
void dfs(int x){
	if(vis[x]) return;
	vis[x]=true;
	cyc.push_back(x);
	dfs(p[x]);
}
int main(){
	ios::sync_with_stdio(false);
	cin>>n>>q;
	for(int i=1;i<=n;i++) cin>>p[i];
	for(int i=1;i<=n;i++) if(!vis[i]){
		cyc.clear();
		dfs(i);
		rcyc=cyc;
		int k=cyc.size();
		reverse(rcyc.begin(),rcyc.end());
		for(int i=0;i<k;i++) rcyc.push_back(rcyc[i]);
		cyc=cyc*rcyc;
		if(!mp.count(k)){
			for(int j=0;j<k;j++) mp[k].push_back(cyc[j+k-1]);
		}else{
			for(int j=0;j<k;j++) mp[k][j+k-1]+=cyc[j+k-1];
		}
	} 
	while(q--){
		int x;cin>>x;ll ans=0; 
		for(auto &i:mp) ans+=i.second[x%i.first];
		cout<<ans<<endl;
	}
	return 0;
}