// #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 s[N + 5], t[105];

signed main() {
	rep(i, 1, N) for(int j = i; j <= N; j += i) ++s[j];
	int T = GetT();
	int q = GetQ();
	long long c = GetC();
	long long n = GetN();
	while(T--) {
		int tmp = 0;
		rep(i, 0, 99) t[i] = Ask(i);
		rep(i, 1, N) {
			bool is = 1;
			rep(j, 0, 99) is &= s[i + j] == t[j];
			if(is) {
				Answer(i);
				break;
			}
		}
	}
	return 0;
}