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

//入力が必ず-mod<=a<modの時.
template<const int mod> //mod<2^30.
struct modint{ //mod変更が不可能.
    public:
    long long v;
    static void setmod(int m){} //飾り.
    static constexpr long long getmod(){return mod;}
    modint():v(0){}
    template<typename T>
    modint(T a):v(a){if(v < 0) v += mod;}
    long long val()const{return v;}
 
    modint &operator=(const modint &b) = default;
    modint &operator+()const{return (*this);}
    modint operator-()const{return modint(0)-(*this);}
    modint operator+(const modint b)const{return modint(v)+=b;}
    modint operator-(const modint b)const{return modint(v)-=b;}
    modint operator*(const modint b)const{return modint(v)*=b;}
    modint operator/(const modint b)const{return modint(v)/=b;}
    modint &operator+=(const modint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    modint &operator-=(const modint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    modint &operator*=(const modint b){v = v*b.v%mod; return *this;}
    modint &operator/=(modint b){ //b!=0 mod素数が必須.
        assert(b.v != 0);
        (*this) *= b.pow(mod-2);
        return *this;
    }
    modint pow(long long n)const{
        modint ret = 1,p = v;
        if(n < 0) p = p.inv(),n = -n;
        while(n){
            if(n&1) ret *= p;
            p *= p; n >>= 1;
        }
        return ret;
    }
    modint inv()const{return pow(mod-2);} //素数mod必須.
 
    modint &operator++(){*this += 1; return *this;}
    modint &operator--(){*this -= 1; return *this;}
    modint operator++(int){modint ret = *this; *this += 1; return ret;}
    modint operator--(int){modint ret = *this; *this -= 1; return ret;}
    friend bool operator==(const modint a,const modint b){return a.v==b.v;}
    friend bool operator!=(const modint a,const modint b){return a.v!=b.v;}
    friend bool operator<(const modint a,const modint b){return a.v<b.v;}
    friend bool operator<=(const modint a,const modint b){return a.v<=b.v;}
    friend bool operator>=(const modint a,const modint b){return a.v>=b.v;}
    friend bool operator>(const modint a,const modint b){return a.v>b.v;}
    friend ostream &operator<<(ostream &os,const modint a){return os<<a.v;}
    friend istream &operator>>(istream &is,modint &a){ //入力はmodをとってくれる.
        long long x; is >> x; x %= mod;
        a = modint(x); return is;
    }
};
using mint = modint<998244353>; const long long mod = 998244353;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N,Q; cin >> N >> Q;
    vector<long long> A(N);
    for(auto &a : A) cin >> a;   
    //1 5 7 11, 1 11 19 29

    mint answer = 0;
    map<int,tuple<mint,mint,mint,mint>> M1,M2;
    auto update = [&](int pos,int x,int v) -> void {
        if(x == 1 || x == 5 || x == 7 || x == 11){
            auto &[v1,v2,v3,v4] = M1[pos];
            answer -= v1*v2*v3*v4;
            if(x == 1) v1 += v;
            if(x == 5) v2 += v;
            if(x == 7) v3 += v;
            if(x == 11) v4 += v;
            answer += v1*v2*v3*v4;
        }
        if(x == 1 || x == 11 || x == 19 || x == 29){
            auto [v1,v2,v3,v4] = M2[pos];
            answer -= v1*v2*v3*v4;
            if(x == 1) v1 += v;
            if(x == 11) v2 += v;
            if(x == 19) v3 += v;
            if(x == 29) v4 += v;
            answer += v1*v2*v3*v4;
        }
    };
    auto change = [&](int x,int v) -> void {
        for(int i=1; i*i<=x; i++) if(x%i == 0){
            update(i,x/i,v);
            if(i*i != x) update(x/i,i,v);
        }
    };
    for(auto a : A) change(a,1);
    while(Q--){
        int t,x; cin >> t >> x;
        if(t == 1) change(x,1);
        else change(x,-1);
        cout << answer << "\n";
    }
    
}