#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false)
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;
const int maxn = 510510 + 20;
int prime[maxn][22], a[maxn];
void init() {
    for (int i = 2; i <= maxn - 20; ++i) {
        if (prime[i][0]) continue;
        for (int j = i; j <= maxn - 20; j += i) {
            prime[j][++prime[j][0]] = i;
        }
    }
//    prime[1][0] = 1;
//    prime[1][1] = 1;
}
bool in[maxn];
int num[maxn];
void maintain(int val, int op) {
    int en = (1 << prime[val][0]) - 1;
    for (int i = 1; i <= en; ++i) {
        int res = 1;
        for (int j = 1; j <= prime[val][0]; ++j) {
            if (i & (1 << (j - 1))) res *= prime[val][j];
        }
        num[res] += op;
    }
}
LL ans;
LL getAns(int val) {
    LL ans = 0;
    int en = (1 << prime[val][0]) - 1;
    for (int i = 1; i <= en; ++i) {
        int res = 1;
        int sel = 0;
        for (int j = 1; j <= prime[val][0]; ++j) {
            if (i & (1 << (j - 1))) {
                ++sel;
                res *= prime[val][j];
            }
        }
        if (sel & 1) ans += num[res];
        else ans -= num[res];
    }
    return ans;
}
void work() {
    int n, q, tot = 0;
    scanf("%d%d", &n, &q);
    for (int i = 1; i <= n; ++i) scanf("%d", a + i);
    for (int i = 1; i <= q; ++i) {
        int id;
        scanf("%d", &id);
        if (in[id]) {
            maintain(a[id], -1);
            in[id] = false;
            ans -= getAns(a[id]);
            tot--;
        } else {
            ans += getAns(a[id]);
            maintain(a[id], 1);
            in[id] = true;
            tot++;
        }
        printf("%I64d\n", 1LL * tot * (tot - 1) / 2 - ans);
    }
}

int main() {
#ifdef local
    freopen("data.txt", "r", stdin);
//    freopen("data.txt", "w", stdout);
#endif
    init();
//    int val = 4;
//    for (int i = 1; i <= prime[val][0]; ++i) {
//        printf("%d ", prime[val][i]);
//    }
//    printf("\n");
    work();
    return 0;
}