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
#include <bits/stdc++.h>
#include "dzilib.h"

using namespace std;
typedef long long ll;
const int MAXN=1e6;

int n,q;
ll c;
int d;
int nod[MAXN+5005];
vector<int> W;

void sieve()
{
	for(int i=1;i<=n+5000;i++){
		for(int j=i;j<=n+5000;j+=i){
			nod[j]++;
		}
	}
}

void solve()
{
	W.clear();
	for(int i=0;i<d;i++){
		W.push_back(Ask(i));
	}
	for(int i=1;i<=n;i++){
		bool ok=1;
		for(int j=0;j<d;j++){
			if(nod[i+j]!=W[j]){
				ok=0;
				break;
			}
		}
		if(ok){
			Answer(i);
			return;
		}
	}
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int t = GetT();
	n = GetN();
	q = GetQ();
	c = GetC();
	d = q / t;
	
	sieve();

	while(t--) solve();
	
	return 0;
}