1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) int(a.size())
#define f(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) f(i, 0, a)
#define int ll
#define tv(a, x) for (auto& a : x)
#define DUZO 1000000000000000000LL
#define en "\n"
#define cn continue
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vii = vector<pii>;

int n, q;
unordered_set<int> zl;
vi p;

void rob() {
    int k = sz(zl);
    if (k == 0) {
        cout << 0 << en;
        return;
    }
    int wyn = 1;
    f(j, 2, min(n - 1, (n * 2)/k)) {
        tv(ele, zl) {
            p[ele%j]++;
            wyn = max(wyn, p[ele%j]);
        }
        tv(ele, zl) {
            p[ele%j]--;
        }
    }
    cout << wyn << en;
}

void solve() {
    cin >> n >> q;
    p.resize(n + 1, 0);
    f(_, 0, q) {
        int ind;
        cin >> ind;
        auto it = zl.find(ind);
        if (it!=zl.end()) zl.erase(it);
        else zl.insert(ind);
        rob();
    }
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int q = 1;
    //cin >> q;
    while (q--) {
        solve();
    }
    return 0;
}