#include <bits/stdc++.h>
using namespace std;

#define all(x) (x).begin(), (x).end()

int main() {
    int N, Q; cin >> N >> Q;
    
    vector<map<int, int>> cnt(2);
    int ans = 0;
    
    vector<vector<int>> A = {
        {1, 5, 7, 11}, 
        {1, 11, 19, 29}
    };
    
    auto f = [&](int i, int s, int d) -> void {
        vector<int> upd;
        vector<int> a = A[i];
        for (int b : a) {
            if (s % b == 0) {
                upd.push_back(s/b);
            }
        }
        sort(all(upd)); upd.erase(unique(all(upd)));
        
        for (int u : upd) {
            ans -= (cnt[i][u] == 4);
        }
        for (int b : a) {
            if (s % b == 0) {
                cnt[i][s/b] += d;
            }
        }
        
        for (int u : upd) {
            ans += (cnt[i][u] == 4);
        }
    };
    
    auto g = [&](int s, int d) -> void {
        f(0, s, d);
        f(1, s, d);
    };
    
    for (int i = 0; i < N; i++) {
        int s; cin >> s;
        g(s, 1);
    }
    
    while(Q--) {
        int q, s; cin >> q >> s;
        int t = (q == 1? 1 : -1);
        g(s, t);
        cout << ans << endl;
    }
}