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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
// Arti1990, II UWr

#include <bits/stdc++.h>
#include "dzilib.h"

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; cin>>_tests; FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#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 MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;
#define SIZE(coll) 					((int)coll.size())

#define M 1000000007
#define INF 1000000007LL

using namespace std;

long long t, q, c, n;
long long dl = 64, tab[100007];
vector <long long> v0;
const int ile_test = 10;
long long do_testu[ile_test][2] = {{64, 2}, {81, 3}, {25, 5}, {49, 7}, {11, 11}, {13, 13}, {17, 17}, {19, 19}, {23, 23}, {29, 29}};
map <long long, long long> queries;

long long myAsk(long long x)
{
    if(queries.count(x) == 0)
        queries[x] = Ask(x);
    return queries[x];
}

vector <int> dzielniki(long long nr)
{
    vector <int> res;
    for(long long i=2; i*i <= nr; i++)
        while(nr%i == 0)
        {
            res.PB(i);
            nr /= i;
        }
    if(nr > 1)
        res.PB(nr);
    return res;
}

long long licz_dzielniki(long long nr)
{
    long long res = 1;
    auto dz = dzielniki(nr);
    for(int i=0; i < dz.size(); i++)
    {
        int dl = 2;
        while(i+1 < dz.size() && dz[i+1] == dz[i])
        {
            i++;
            dl++;
        }
        res *= dl;
    }
    return res;
}
/*
bool sprawdz(long long nr)
{
    forr(i, dl)
    {
        //cout << "sprawdza " << nr+i << ", dzielniki: " << licz_dzielniki(nr+i) << ", powinno byc " << tab[i] << '\n';
        if(licz_dzielniki(nr+i) != tab[i])
            return 0;
    }
    return 1;
}

int solve0()
{
    //if (Ask(1) == 8) Answer(1000);
    //else Answer(1);
    map <long long, long long> mapa;
    forr(i, dl)
    {
        tab[i] = Ask(i);
        v0.PB(tab[i]);
        auto dz = dzielniki(tab[i]);
        cout << "dzielniki dla " << i << ": ";
        for(auto el : dz)
        {
            cout << el << " ";
            mapa[el]++;
        }
        cout << '\n';
    }
    for(auto p : mapa)
    {
        cout << p.ff << " " << p.ss << '\n';
    }

    long long i, j;
    for(i=0; true; i++)
        if(Ask(i)%2 == 1)
            break;
    for(j=i+3; true; j += 2)
        if(Ask(j)%2 == 1)
            break;

    long long r = (j+1-i)/2;
    if(sprawdz(r*r-j))
        Answer(r*r-j);
    else
        cout << "nie dziala" << '\n';


    return 0;
}
*/
bool sprawdz(long long nr)
{
    for(auto el : queries)
    {
        //cout << "sprawdza " << nr+i << ", dzielniki: " << licz_dzielniki(nr+i) << ", powinno byc " << tab[i] << '\n';
        if(licz_dzielniki(nr+el.ff) != el.ss)
            return 0;
    }
    return 1;
}

int solve()
{    
    queries.clear();

    set <long long> candidates, pre;
    long long x = 10*n + rand()%n;
    forr(i, 4)
        if(myAsk(10*n+i) % 2 == 0)
            candidates.insert(x+i);
    
    long long step, i;
    for(step = 2, i = 2; (1LL<<i) < 2*n; i++, step *= 2)
    {
        pre = candidates;
        candidates.clear();
        for(auto el : pre)
        {
            //cout << "na poziomie " << i << " kandydat to " << el << '\n';
            if(myAsk(el-step)%(i+1) == 0)
                candidates.insert(el-step);
            if(myAsk(el+step)%(i+1) == 0)
                candidates.insert(el+step);
        }
    }

    if(candidates.size() == 1)
    {
        long long res = (*candidates.begin()) % step;
        Answer(step-res);
    }
    else if(candidates.size() > 1)
    {
        for(auto el : candidates)
            if(sprawdz(step-el))
                Answer(step-el);
    }
    else
        cout << "Nie znalazl nic" << '\n';

    return 0;
}

int main()
{
    //std::ios_base::sync_with_stdio(0);
    //cin.tie(0);
    //cout.tie(0);

    char x;
    srand(time(0) + (long long)&x);
    
    t = GetT();
    q = GetQ();
    c = GetC();
    n = GetN();

    forr(test, t)
        solve();

    return 0;
}