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
#pragma GCC optimize("Ofast")
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
 #include "dzilib.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
//typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define pss pair<short,short>
#define pld pair<long double,long double >
#define ld long double
#define piii  pair<pii,int>
#define vii vector<pair<int,int> >
#define st first
#define nd second
#define pll pair<ll,ll>
#define speed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define M_PI 3.14159265358979323846
#define int long long
//const int mod=1000000007;
//const int mod=1009;
const int mod=998244353;
const int inf=1000000009;
const long long INF=1000000000000000009;
const long long big=1000000000000000;
const long double eps=0.000000000000000000001;
const int rozmiar=2e6+5,liczba=1100000;
int D[rozmiar];
void dzielniki(int n){
    for(int i=1;i<=n;i++){
        for(int j=i;j<=n;j+=i)
            D[j]++;
        //cout<<i<<" "<<D[i]<<endl;
    }
}
void solve()
{
    int n=GetN(),q=GetQ(),c=GetC();
    vi A,B;
    for(int i=1;i<=n;i++)
        A.pb(i);
    int wsk=0;
    while(A.size()>1){
        int ans=Ask(wsk);
        for(auto el:A){
            if(D[el+wsk]==ans)
                B.pb(el);
        }
        A.clear();
        A=B;
        B.clear();
        wsk++;
    }
    Answer(A[0]);
}
    
int32_t main(){
    speed
    //cout<<"KURWA"<<endl;
    int t = GetT();
    dzielniki(liczba);
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}