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
#include <algorithm>
#include <cstdio>
#include <map>
#include <set>
#include <vector>
using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define VAR(v,w) __typeof(w) v=(w)
#define FORE(it,c) for(VAR(it,(c).begin());it!=(c).end();++it)
#define PB push_back
#define SIZE(c) ((int)(c).size())
#define INT(x) int x; scanf("%d", &x)

typedef vector<int> VI;

bool p[10000000];
VI pv;

int main() {
	INT(n);
	FOR(i,2,n) p[i] = 1;
	FOR(i,2,n) if (p[i]) for (int j = i << 1; j < n; j += i) p[j] = 0;
	REP(i,n) if (p[i]) pv.PB(i);
	INT(q);
	set<int> s;
	REP(qq,q) {
		INT(a);
		--a;
		VAR(it,s.find(a));
		if (it == s.end()) s.insert(a);
		else s.erase(it);
		int d = SIZE(s);
		if (d <= 1) {
			printf("%d\n", d);
			continue;
		}
		int k = max(min(((n << 1) + d - 1) / d, n - 1), 2);
		int r = 0;
		FORE(pt,pv) {
			if (*pt > k) break;
			map<int, int> m;
			FORE(st,s) r = max(r, ++m[*st % *pt]);
		}
		printf("%d\n", r);
	}
}