// Przykładowe niepoprawne rozwiązanie do zadania Dzielniki.
#include "dzilib.h"
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <map>

using namespace std;
using LL = long long;
using PLL = pair<LL, LL>;
const LL N = 1e6 + 105, mod1 = 1e9 + 7, mod2 = 998244353, P = 1009;

int d[N], prime[N], spcnt[N], pcnt;
LL H1[N], Hash1[N], H2[N], Hash2[N], Pow1[N], Pow2[N];
map<PLL, bool> vis;
void Sieze()
{
    d[1] = 1;
    for (int i = 2; i < N; i++)
    {
        if (!d[i])
        {
            d[i] = 2;
            spcnt[i] = 1;
            prime[++pcnt] = i;
        }
        for (int j = 1; j <= pcnt && i * prime[j] < N; j++)
        {
            if (i % prime[j])
            {
                d[i * prime[j]] = d[i] * 2;
                spcnt[i * prime[j]] = 1;
            }
            else
            {
                d[i * prime[j]] = d[i] / (spcnt[i] + 1) * (spcnt[i] + 2);
                spcnt[i * prime[j]] = spcnt[i] + 1;
                break;
            }
        }
        H1[i] = (H1[i - 1] * P % mod1 + d[i]) % mod1;
        H2[i] = (H2[i - 1] * P % mod2 + d[i]) % mod2;
    }
    Pow1[0] = Pow2[0] = 1;
    for (int i = 1; i < N; i++)
    {
        Pow1[i] = Pow1[i - 1] * P % mod1;
        Pow2[i] = Pow2[i - 1] * P % mod2;
    }
    for (int i = 100; i < N; i++)
    {
        Hash1[i] = (H1[i] - H1[i - 100] * Pow1[100] % mod1 + mod1) % mod1;
        Hash2[i] = (H2[i] - H2[i - 100] * Pow2[100] % mod2 + mod2) % mod2;
    }
}

int main() 
{
    int t = GetT(), q = GetQ(), c = GetC(), n = GetN();
    Sieze();
    while (t--)
    {
        LL sum1 = 0, sum2 = 0;
        for (int i = 0; i < 100; i++)
        {
            LL d = Ask(i);
            sum1 = (sum1 * P % mod1 + d) % mod1;
            sum2 = (sum2 * P % mod2 + d) % mod2;
        }
        for (int i = 1; i < N; i++)
        {
            if (sum1 == Hash1[i] && sum2 == Hash2[i])
            {
                Answer(i - 99);
                break;
            }
        }
    }
    return 0;
}