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

using namespace std;
#define PB push_back
#define LL long long
#define int LL
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORD(i,a,b) for (int i = (a); i >= (b); i--)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define st first
#define nd second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define VI vector<int>
#define PII pair<int,int>
#define LD long double


template<class T> ostream &operator<<(ostream &os, vector<T> V){
    os<<"[";for(auto vv:V)os<<vv<<",";return os<<"]";
}

template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
    return os << "(" << P.st << "," << P.nd << ")";
}


template<class C> void mini(C& a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C& a4, C b4) { a4 = max(a4, b4); }

template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";}
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while(*sdbg!=',')cerr<<*sdbg++;cerr<<"="<<h<<","; _dbg(sdbg+1, a...);
}


#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

map<int,int> occurence;
map<int, VI> occurence_vector;
int MAXN = 1e6 + 1000;
VI divisors(MAXN + 1);

bool check_fits(const VI & a, const VI & b, int l){
    REP(i, SZ(a)){
        if(a[i] != b[i + l]){
            return false;
        }
    }
    return true;
}

int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(11);
  cerr << fixed << setprecision(6);
  
  set<int> divisor_number;
  for(int i = 1; i <= MAXN; i++){
    for(int j = i; j <= MAXN; j += i){
      divisors[j]++;
    }
  }
  REP(i, MAXN){
    int a = divisors[i];
    occurence[a]++;
    occurence_vector[a].PB(i);
  }
  int t = GetT();
  int n = GetN();
  int q = GetQ();
  int c = GetC();
  int asked = 0;
  REP(i, t){
    VI collected;
    REP(j, 100){
        collected.PB(Ask(j));
        asked++;
        debug(asked);
    }
    // now we need to find interval collected in divisors
    // lets find the rarest number first
    int best_divisor = -1;
    int best_occurence = 1e9;
    for(int a: collected){
      if(occurence[a] < best_occurence){
        best_occurence = occurence[a];
        best_divisor = a;
      }
    }
    int idx = -1;
    REP(j, 100){
      if(collected[j] == best_divisor){
        idx = j;
        break;
      }
    }
    debug(collected, best_divisor);
    for(int a: occurence_vector[best_divisor]){
        int l = a - idx;
        debug(l);
        VI b;
        assert(divisors[a] == best_divisor);
        FOR(j, l, l + 99){
            if(j < 0 || j >= MAXN){
                b.PB(0);
            } else {
                b.PB(divisors[j]);
            }
        }
        debug(l, b, collected);
      if(b == collected){
            debug("Answer", l);
          Answer(l);
          break;
      }
    }
    nxt:;
  }
}