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
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <deque>
#include <tuple>
#include <bitset>

using namespace std;

#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define x first
#define y second

typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;

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

    ll n, q;
    cin >> n >> q;
    int ans = 0;

    vi Q;
    int min_a = 1e7+4;
    int max_a = -1;

    while(q--){
        int a;
        cin >> a;

        if(a>max_a){
            max_a = a;
        }

        if(a<min_a){
            min_a = a;
        }
        Q.pb(a);
    }

    int MAXP = max_a - min_a + 2;

    vector<bool> is_prime(MAXP+1, true);
    vector<ll> primes;
    is_prime[0] = is_prime[1] = false;
    for (int i = 2; i <= MAXP; i++) {
        if(is_prime[i]){
            primes.pb(i);
        }
        if(is_prime[i] && (ll)i * i <= MAXP) {
            for(int j = i * i; j <= MAXP; j += i)
                is_prime[j] = false;
        }
    }

    vector<vi> mods(primes.size());
    vector<vi> freq(primes.size());
    vector<bool> A(n+1, false);
    vi K(primes.size(), 0);
    vi K_freq(n+10, 0);
    K_freq[0] = primes.size();

    for(int i=0; i<primes.size(); i++){
        int p = primes[i];
        mods[i].assign(p, 0);
        freq[i].assign(n/p+ 10, 0);
        freq[i][0] = p;
    }

    reverse(Q.begin(), Q.end());


    while(Q.size()){
        int a = Q.back();
        Q.pop_back();

        A[a] = !A[a];

        for(int i=0; i<primes.size(); i++){
            int p = primes[i];
            int m = a%p;

            int prev = mods[i][m];
            int now  = mods[i][m]+(A[a] ? 1 : -1);

            mods[i][m] = now;
            freq[i][prev]--;
            freq[i][now]++;

            int prev_K = K[i];

            if(now > K[i]){
                K[i] = now;
            }else if(prev == K[i] && freq[i][prev]==0){
                K[i]--;
            }

            if(prev_K != K[i]){
                K_freq[prev_K]--;
                K_freq[K[i]]++;

                if(K[i]>ans){
                    ans = K[i];
                }else if(prev_K == ans && K_freq[prev_K] == 0){
                    ans--;
                }
            }
        }

        cout << ans << "\n";
    }

    return 0;
}