/*
* @Author: zxxzy
* @Date:   2024-10-28 22:26:06
*/
#include <iostream>
#include <algorithm>
#include <cstring>
#include <bitset>
#include <set>
#include <cmath>
#include <vector>
#include <map>
//#define int long long
#define space ' '
#define endl '\n'
#define de(x) cout<<"** "<<x<<" **"<<endl;
#define N 200005
using namespace std;
// using ll = long long;
using ll=__int128;
const ll mod =1231453023109121;
const int INF = 0x3f3f3f3f;
const double eps = 1e-6;
const int G=3;
int rev[(1<<19)+5];
ll ww[2][(1<<19)+5];
ll ppow(ll a,ll b){
    ll res=1;
    while(b){
        if(b&1)res=res*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return res;
}

void prentt(){
    int len=1<<19;
    for(int i=1;i<len;i<<=1){
        ll wka=ppow(G,(mod-1)/(i<<1));
        ll wkb=ppow(wka,mod-2);
        ll wnka=1,wnkb=1;
        for(int k=0;k<i;k++){
            ww[0][i+k]=wnka;
            wnka=wnka*wka%mod;
            ww[1][i+k]=wnkb;
            wnkb=wnkb*wkb%mod;
        }
    }
}
void ntt(vector<ll> &a,int len,int on){
    ll *w=(on==1?ww[0]:ww[1]);
    for(int i=0;i<len;i++)if(i<rev[i])swap(a[i],a[rev[i]]);
    for(int i=1;i<len;i<<=1){
        for(int j=0;j<len;j+=(i<<1)){
            for(int k=0;k<i;k++){
                ll x=a[j+k],y=w[i+k]*a[i+j+k]%mod;
                a[j+k]=(x+y)%mod;
                a[i+j+k]=(x-y+mod)%mod;
            }
        }
    }
    if(on==-1){
        ll inv=ppow(len,mod-2);
        for(int i=0;i<len;i++){
            a[i]=a[i]*inv%mod;
        }
    }
}
vector<ll> polymul(vector<ll> a,int n,vector<ll> b,int m){
    int len=1,k=0;
    while(len<=m+n)len<<=1,k++;
    for(int i=0;i<len;i++){
        rev[i]=(rev[i>>1]>>1)|((i&1)<<(k-1));
    }
    a.resize(len);
    b.resize(len);
    ntt(a,len,1);
    ntt(b,len,1);
    for(int i=0;i<len;i++)a[i]=a[i]*b[i]%mod;
    ntt(a,len,-1);
    a.resize(n+m+1);
    return a;
}
signed main() {
    #ifdef LOCAL
    	freopen("D:\\code2023\\test\\input.txt", "r", stdin);
    	freopen("D:\\code2023\\test\\output.txt", "w", stdout);
    #endif
	std::ios::sync_with_stdio(false);
	cin.tie(0);
    prentt();
    int n,q;
    cin>>n>>q;
    vector<int> p(n+1);
    for(int i=1;i<=n;i++){
        cin>>p[i];
    }
    vector<int> vis(n+1);
    vector<vector<ll>> xunhuan;
    for(int i=1;i<=n;i++){
        if(!vis[i]){
            vector<ll> tmp;
            int now=i;
            while(p[now]!=i){
                tmp.push_back(now);
                vis[now]=1;
                now=p[now];
            }
            vis[now]=1;
            tmp.push_back(now);
            // reverse(tmp.begin(),tmp.end());
            xunhuan.push_back(tmp);
            // for(int ss:tmp)cout<<ss<<space;cout<<endl;
        }
    }
    vector<vector<long long>> zhongjian;
    for(auto &vec:xunhuan){
        int nn=vec.size();
        vector<ll> tmp=vec;
        reverse(tmp.begin(),tmp.end());
        for(int i=0;i<nn;i++){
            vec.push_back(vec[i]);
        }
        vector<ll> f=polymul(vec,2*nn-1,tmp,nn-1);
        // for(int ss:vec)cout<<ss<<space;cout<<endl;
            // for(int ss:tmp)cout<<ss<<space;cout<<endl;
        vector<long long> fans;
        for(int j=2*nn-1;j>=nn;j--){
            fans.push_back(f[j]);
        }
        // for(int ss:fans)cout<<ss<<space;cout<<endl;
        zhongjian.push_back(fans);
    }
    sort(zhongjian.begin(), zhongjian.end(), [](vector<long long> &a, vector<long long> &b) {
        return a.size() < b.size();
    });
    vector<vector<long long>> finalans;
    for(int i=0;i<zhongjian.size();i++){
        int now=i;
        vector<long long> h=zhongjian[i];
        while(now+1<zhongjian.size()&&zhongjian[now].size()==zhongjian[now+1].size()){
            for(int j=0;j<h.size();j++){
                h[j]+=zhongjian[now+1][j];
            }
            now++;
        }
        i=now;
        finalans.push_back(h);
    }
    while(q--){
        long long ans=0;
        int k;
        cin>>k;
        for(auto &vec:finalans){
            int nn=vec.size();
            k%=nn;
            ans+=vec[k];
        }
        cout<<ans<<endl;
    }
	return 0;
}