#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef complex<double> C;
typedef vector<double> vd;
#define vi vector<int>
#define all(a) a.begin(),a.end()
#define sz(x) (int)x.size()
#define rep(x, s, e) for(int x = s; x < e; x++)

void fft(vector<C>& a) {
	int n = sz(a), L = 31 - __builtin_clz(n);
	static vector<complex<long double>> R(2, 1);
	static vector<C> rt(2, 1);  // (^ 10% faster if double)
	for (static int k = 2; k < n; k *= 2) {
		R.resize(n); rt.resize(n);
		auto x = polar(1.0L, acos(-1.0L) / k);
		rep(i,k,2*k) rt[i] = R[i] = i&1 ? R[i/2] * x : R[i/2];
	}
	vi rev(n);
	rep(i,0,n) rev[i] = (rev[i / 2] | (i & 1) << L) / 2;
	rep(i,0,n) if (i < rev[i]) swap(a[i], a[rev[i]]);
	for (int k = 1; k < n; k *= 2)
		for (int i = 0; i < n; i += 2 * k) rep(j,0,k) {
			// C z = rt[j+k] * a[i+j+k]; // (25% faster if hand-rolled)  /// include-line
			auto x = (double *)&rt[j+k], y = (double *)&a[i+j+k];        /// exclude-line
			C z(x[0]*y[0] - x[1]*y[1], x[0]*y[1] + x[1]*y[0]);           /// exclude-line
			a[i + j + k] = a[i + j] - z;
			a[i + j] += z;
		}
}
vector<ll> conv(const vector<ll>& a, const vector<ll>& b) {
	if (a.empty() || b.empty()) return {};
	vector<ll> res(sz(a) + sz(b) - 1);
	int L = 32 - __builtin_clz(sz(res)), n = 1 << L;
	vector<C> in(n), out(n);
	copy(all(a), begin(in));
	rep(i,0,sz(b)) in[i].imag(b[i]);
	fft(in);
	for (C& x : in) x *= x;
	rep(i,0,n) out[i] = in[-i & (n - 1)] - conj(in[i]);
	fft(out);
	rep(i,0,sz(res)) res[i] = imag(out[i]) / (4 * n);
	return res;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, q;
    cin >> n >> q;
    vector<int> a(n);
    for (int &i : a) cin >> i, i--;
    vector<vector<ll>> s(n + 1);
    vector<int> v;
    vector<bool> vis(n);
    for (int i = 0; i < n; i++) {
        if (vis[i]) continue;
        vector<int> cyc{i};
        vis[i] = 1;
        while (a[cyc.back()] != i) {
            cyc.push_back(a[cyc.back()]);
            vis[cyc.back()] = 1;
        }
        vector<ll> A;
        for (int i : cyc) A.push_back(i + 1);
        for (int i : cyc) A.push_back(i + 1);
        vector<ll> B;
        for (int i : cyc) B.push_back(i + 1);
        reverse(B.begin(), B.end());
        auto D = conv(A, B);
        int m = cyc.size();
        if (s[m].empty()) {
            v.push_back(m);
            s[m].resize(m + 1);
        }
        for (int i = m - 1; i < 2 * m - 1; i++) {
            s[m][i - m + 1] += D[i];
        }
    }
    while (q--) {
        int k;
        cin >> k;
        ll ans = 0;
        for (int i : v) {
            ans += s[i][k % i];
        }
        cout << ans << "\n";
    }
}