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
#include <vector>
#include <iostream>
#include <sstream>
#include <math.h>
#include <sys/time.h>
#include <cstdlib>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <fstream>
#include <set>
#include <map>
#include <iomanip>
#include <queue>

#include "dzilib.h"

#define FOR(i,a,b)  for(__typeof(b) i=(a);i<(b);++i)
#define REP(i,a)    FOR(i,0,a)
#define FOREACH(x,c)   for(__typeof(c.begin()) x=c.begin();x != c.end(); x++)
#define ALL(c)      c.begin(),c.end()
#define CLEAR(c)    memset(c,0,sizeof(c))
#define SIZE(c) (int) ((c).size())

#define PB          push_back
#define MP          make_pair
#define X           first
#define Y           second

#define ULL         unsigned long long
#define LL          long long
#define LD          long double
#define II         pair<int, int>
#define DD         pair<double, double>
#define FF          pair<float,float>

#define VC	    vector
#define VI          VC<int>
#define VVI         VC<VI>
#define VVVI        VC<VVI>
#define VD          VC<double>
#define VS          VC<string>
#define VII         VC<II>
#define VDD         VC<DD>
#define VFF         VC<FF>
#define VVD         VC<VD>
#define VVVD        VC<VVD>
#define VULL         VC<ULL>

#define DB(a)       cerr << #a << ": " << a << endl;

using namespace std;

template<class T> void print(VC < T > v) {cerr << "[";if (SIZE(v) != 0) cerr << v[0]; FOR(i, 1, SIZE(v)) cerr << "," << v[i]; cerr << "]\n";}
template<class T> string i2s(T &x) { ostringstream o; o << x; return o.str(); }
VS split(string &s, char c = ' ') {VS all; int p = 0, np; while (np = s.find(c, p), np >= 0) {all.PB(s.substr(p, np - p)); p = np + 1;} if (p < SIZE(s)) all.PB(s.substr(p)); return all;}

map<ULL,ULL> ans;

ULL ask(ULL x){
    if (ans.count(x) == 0)
        ans[x] = Ask(x);
    return ans[x];
}

int main(int argc, char *argv[]){
    int T = GetT();
    int Q = GetQ();
    ULL C = GetC();
    ULL N = GetN();
    srand((unsigned)time(0));

    int primes[] = {3, 5, 7, 9, 10, 11, 12, 13, 14, 15, 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};

    REP(t,T){
        ans.clear();
        int prevExp = 0;
        ULL prev = 1ULL << prevExp;
        int ind = 0;
        ULL rem = 0;
        while(1){
            // INV: rem is the inverse remainder of x % 2^{prevExp}
            ULL delta = rem; 
            ULL cur = 1ULL << primes[ind];
            int cnt = cur/prev;
            set<int> S;
            REP(i,cnt) S.insert(i);
            while(1){
                REP(i,cnt){
                    //cout << ".";
                    if (ask(delta)%primes[ind] != 0){
                        S.erase(i);
                        if (SIZE(S) == 1)
                            break;
                    }
                    delta += prev;
                }
                if (SIZE(S) == 1)
                    break;
            }
            // S contains the exact 2^k remainder, the other one is 2^(k+1)
            ULL slot = (*(S.begin()) + cnt/2)%cnt;
            rem = slot*prev+rem;
            //cout << rem << " TO " << cur << endl;
            //cout.flush();
            if ( cur >= N){
                Answer(cur-rem);
                //cout << endl;
                break;
            }
            prevExp = primes[ind];
            prev = cur;
            ind++;
        }
    }

    return 0;
}