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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <bits/stdc++.h>
using namespace std;

bool sito[10'000'007];

set<int> kamyki;
int modulo[10'000'007];

int insert_if(set<int>& s, int val) {
    auto it = s.find(val);
    if (it != s.end()) {
        s.erase(it);
        return -1;
    } else {
        s.insert(it, val);
        return 1;
    }
}

void print(int* tab, int l, int r, string name) {
    cerr << name << ": ";
    for (int i = l; i <= r; i++) {
        cerr << tab[i] << " ";
    }
    cerr << "\n";
}

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

    int n, q;
    cin >> n >> q;

    vector<int> primes;
    for (int i = 2; i <= n; i++) {
        if (!sito[i]) {
            primes.push_back(i);
            for (int j = 2 * i; j <= n; j += i) {
                sito[j] = true;
            }
        }
    }

    int d = 0;
    for (int i = 1; i <= q; i++) {
        int a;
        cin >> a;
        d += insert_if(kamyki, a);

        // cerr << "i = " << i << "\n";

        int out = 0;

        if (d > 0) {
            for (int k: primes) {

                    // cerr << "k = " << k << " d = "  << d << "\n";

                    if (k <= (2 * n) / d) {
                        for (int x: kamyki) {
                            modulo[x % k]++;
                            out = max(out, modulo[x % k]);
                        }

                        // print(modulo, 0, k, "modulo");

                        for (int x: kamyki) {
                            modulo[x % k] = 0;
                        }
                    }

                    else {
                        break;
                    }
                }     
        }
        

        cout << out << "\n";
    }

    return 0;

}