// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include "dzilib.h"
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <random>
#include <iomanip>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

const int N = 1e6 + 100;

int a;
map<int, int> mp;

int ask(int n) {
	if(mp.count(n)) return mp[n];
	return Ask(n);
}
int dfs(int n, int m) {
	if(m == a) {
		cerr << n << endl;
		return n;
	}
	int x = ask(n), y = ask(n + (1ll << m)), res = 0;
	// cerr << x << ' ' << y << endl;
	if(x % (m + 1) == 0) res |= dfs(n + (1ll << m), m + 1);
	if(y % (m + 1) == 0) res |= dfs(n, m + 1);
	return res;
}

signed main() {
	int T = GetT();
	GetQ();
	GetC();
	a = __lg(GetN()) + 1;
	while(T--) {
		mp.clear();
		int res = dfs(0, 0);
		// cerr << (1ll << a) << ' ' << res << endl;
		Answer((1ll << a) - res);
	}
	return 0;
}