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
#include <bits/stdc++.h>
#include "dzilib.h"
using namespace std;
 
#ifdef DEBUG
auto &operator<<(auto &o, pair<auto, auto> p) {
    return o << "()" << p.first << ", " << p.second <<")";
}
auto operator<<(auto &o, auto x)-> decltype(x.end(), o) {
    o << "{";int i = 0;
    for(auto e : x) o << ", "+!i++<<e;
    return o <<"}";
}
#define debug(x...) cerr << "["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(x)
#else
#define debug(...) {}
#endif

#define all(x) x.begin(), x.end()
#define pb push_back
#define fi first
#define se second
typedef pair <int, int> pii;

constexpr int N = 1e6+100, Z = 2e1;
int D[N];
map <vector <int>, int> M;


int test(int i) {
    debug(i);
    int cn=0;
    vector <int> x;
    for (int i=0; i<Z; ++i) {
        x.pb(Ask(i));
    }
    Answer(M[x]);

    return cn;
}
 
signed main() {
  // ios_base::sync_with_stdio(0); cin.tie(0);
  int t = GetT();
  int n = GetN();
  int q = GetQ();
  int qc = 0;

  for (int i=1; i<N; ++i) {
    for (int j=i; j<N; j+=i) {
        D[j]++;
    }
  }

  for (int i=1; i<=n; ++i) {
    vector <int> x;
    for (int j=0; j<Z; ++j) {
        x.pb(D[i+j]);
    }   
    M[x] = i;
  }

  while (t--) {
    qc += test(t);
  }
  assert(qc <= q);
}