#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	// 1,5,7,11
	// 1,11.19.29
	int n, q; cin >> n >> q;
	set<long long>st;
	mint ans = 0;
	vector<int>x = { 1,5,7,11 };
	vector<int>y = { 1,11,19,29 };

	auto f = [&](long long s, int type) {
		rep(_, 2) {
			rep(i, 4) {
				if (s%x[i])continue;
				vector<int>v(4);
				bool chk = true;
				rep(j, 4)if (i != j) {
					long long val = s / x[i] * x[j];
					chk &= st.count(val);
				}
				if (!chk)continue;
				if (type == 1)ans += chk;
				else ans -= chk;
			}
			x.swap(y);
		}
	};

	rep(i, n) {
		int s; cin >> s;
		f(s, 1);
		st.insert(s);
	}

	while (q--) {
		int t; cin >> t;
		long long s; cin >> s;

		f(s, t);
		if (t == 1)st.insert(s);
		else st.erase(s);

		cout << ans.val() << endl;
	}
	return 0;
}