void solve() {
    read(n, m);
    rep(i, 1, m) {
        int x, cnt = 0;
        read(x);
        x = __gcd(x, n);
        if (!use[x]) {
            rep(i, 1, n/x) {
                if (!vis[i*x]) {
                    vis[i*x] = true;
                    cnt++;
                }   
            }
            use[x] = true;
        }
        cout << cnt << ' ';
    }
}