//code by Emissary
#include<bits/stdc++.h>

#define fi first
#define se second
#define vc vector
#define db double
#define ll long long
#define mk make_pair
#define pb push_back
#define PI pair<int,int>
#define ull unsigned long long
#define err cerr << "   -_-   " << endl
#define debug cerr << " ------------------- " << endl

#define input(x) freopen(#x".in","r",stdin)
#define output(x) freopen(#x".out","w",stdout)

#define NO puts("No")
#define YES puts("Yes")

#define int long long

using namespace std;

namespace IO{
	inline int read(){
		int X=0, W=0; char ch=getchar();
		while(!isdigit(ch)) W|=ch=='-', ch=getchar();
		while(isdigit(ch)) X=(X<<1)+(X<<3)+(ch^48), ch=getchar();
		return W?-X:X;
	}
	inline void write(ll x){
		if(x<0) x=-x, putchar('-');
		if(x>9) write(x/10);
		putchar(x%10+'0');
	}
	inline void sprint(ll x){write(x), putchar(32);}
	inline void eprint(ll x){write(x), putchar(10);}
}using namespace IO;

const int MAXN = (1 << 21) + 23333;
const long double P = acos(-1.0);

int cnt;
int q, nxt[MAXN], ri[MAXN];

vc<int> node;

ll v[MAXN];

vector<vector<ll> > buc;

bool vis[MAXN];

inline void dfs(int x){
	node.pb(x); vis[x]=1;
	if(!vis[nxt[x]]) dfs(nxt[x]);
} 

struct complexx{
	long double x, y;
	complexx friend operator + (const complexx &x, const complexx &y){return complexx{x.x+y.x,x.y+y.y};}
	complexx friend operator - (const complexx &x, const complexx &y){return complexx{x.x-y.x,x.y-y.y};}
	complexx friend operator * (const complexx &x, const complexx &y){return complexx{x.x*y.x-x.y*y.y,x.y*y.x+x.x*y.y};}
}a[MAXN], b[MAXN];

int n, m;
int limit;
int dp[MAXN];

inline int lowbit(int x){return x & -x;}

inline void getdp(int limit){for(int i=1;i<limit;++i) dp[i]=dp[i-lowbit(i)]+limit/(2*lowbit(i));}

inline void FFTA(int limit, int tp){
	complexx W, Wn, A, B;
	for(int i=0;i<limit;++i) if(i<dp[i]) swap(a[i],a[dp[i]]);
	for(int L=1;L<limit;L<<=1){
		Wn=complexx{cos(P/((long db)L)),sin(P/((long db)L))};
		if(tp==-1) Wn.y=-Wn.y;
		for(int R=L<<1, pos=0;pos<limit;pos+=R){
			W=complexx{1,0};
			for(int k=0;k<L;++k, W=W*Wn){
				A=a[pos+k], B=a[pos+k+L]*W;
				a[pos+k]=A+B;
				a[pos+k+L]=A-B;
			}
		}
	}
	return ;
}

inline void FFTB(int limit, int tp){
	complexx W, Wn, A, B;
	for(int i=0;i<limit;++i) if(i<dp[i]) swap(b[i],b[dp[i]]);
	for(int L=1;L<limit;L<<=1){
		Wn=complexx{cos(P/((long db)L)),sin(P/((long db)L))};
		if(tp==-1) Wn.y=-Wn.y;
		for(int R=L<<1, pos=0;pos<limit;pos+=R){
			W=complexx{1,0};
			for(int k=0;k<L;++k, W=W*Wn){
				A=b[pos+k], B=b[pos+k+L]*W;
				b[pos+k]=A+B;
				b[pos+k+L]=A-B;
			}
		}
	}
	return ;
}

inline void FFT(int siz){
	int limit=1;
	while(limit<=siz*3+3) limit<<=1; getdp(limit);
	for(int i=0;i<limit;++i) a[i]=b[i]=complexx{0,0};
	for(int i=0;i<siz;++i) b[i]=complexx{node[i],0};
	for(int i=0, j=siz-1;i<siz;++i, --j) a[i]=complexx{node[j],0};
	for(int i=siz;i<siz<<1;++i) a[i]=complexx{a[i-siz].x,0};
	FFTA(limit,1); FFTB(limit,1);
	for(int i=0;i<limit;++i) a[i]=a[i]*b[i];
	FFTA(limit,-1);
	for(int i=0;i<limit;++i) v[i]=(ll)(a[i].x/((long db)limit)+0.99997);
	for(int i=0, j=siz-1;i<siz;++i, --j) buc[siz][j]+=v[siz+i];
	return ;
}

signed main(){	
	int x;
	n=read(); q=read(); buc.resize(n+1);
	for(int i=1;i<=n;++i) x=read(), nxt[i]=x;
	for(int i=1;i<=n;++i){
		if(!vis[i]){
			node.clear();
			dfs(i); int t=node.size();
			if(buc[t].size()==0) buc[t].resize(t+2);
			FFT(t); ri[++cnt]=t;
		}
	}
	sort(ri+1,ri+1+cnt); cnt=unique(ri+1,ri+1+cnt)-ri-1;
	while(q--){
		int k=read(); ll ans=0;
		for(int i=1;i<=cnt;++i) ans+=buc[ri[i]][k%ri[i]];
		eprint(ans);
	}
	return 0;
}