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
#include <bits/stdc++.h>
using namespace std;
#define rep(a, b) for (int a = 0; a < (b); a++)
#define rep1(a, b) for (int a = 1; a <= (b); a++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;

const int MAXN = 1e7 + 7;
int n, q;

set<int> nums;
bool toggled[MAXN];

ll last[MAXN];
int counter[MAXN];

ll t = 0;
int ans() {
    int m = nums.size();
    int out = 0;
    for (int k = 2; k <= 2*n/m+1; k++) {
        t++;
        for (int num: nums) {
            int rem = num%k;
            if (last[rem] != t) {
                last[rem] = t;
                counter[rem] = 0;
            }
            out = max(out, ++counter[rem]);
        }
    }
    return out;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    
    cin >> n >> q;
    int pos;
    rep(i, q) {
        cin >> pos;
        if (toggled[pos]) nums.erase(pos);
        else nums.insert(pos);
        toggled[pos] ^= 1;
        cout << ans() << "\n";
    }

    return 0;
}