#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>

using namespace std;

int M, nr, aib[100009], pos[100009], al_k_lea[100009];
bool ap[100009];
char actual[100009];

struct pac
{
    int init;
    string v;
}A[100009];

struct compare
{
    bool operator() (const pac a, const pac b) const
    {
        if (a.v.length() != b.v.length()) return a.v.length() < b.v.length();
        return a.v < b.v;
    }
};

void U (int poz)
{
    while (poz <= M)
    {
        aib[poz] ++;
        poz += (poz - (poz & (poz - 1)));
    }
}


int main()
{
freopen ("nums.in", "r", stdin);
freopen ("nums.out", "w", stdout);

scanf ("%d\n", &M);
for (int i=1; i<=M; i++)
{
    int tip;
    scanf ("%d ", &tip);

    if (tip == 0)
    {
        int x;
        scanf ("%d\n", &x);
        continue;
    }

    gets (actual + 1);
    A[++nr].v = actual + 1;
    A[nr].init = i;
}

sort (A + 1, A + nr + 1, compare());

pos[A[1].init] = 1;
for (int i=2; i<=nr; i++)
    pos[A[i].init] = pos[A[i-1].init] + (A[i].v != A[i-1].v);

for (int i=1; i<=nr; i++)
    al_k_lea[pos[A[i].init]] = i;

freopen ("nums.in", "r", stdin);
scanf ("%d\n", &M);
for (int i=1; i<=M; i++)
{
    int tip;
    scanf ("%d ", &tip);
    if (tip == 0)
    {
        int x, ras = 0;
        scanf ("%d\n", &x);
        for (int j=16; j>=0; j--)
            if (ras + (1<<j) <= M && aib[ras + (1<<j)] < x )
                x -= aib[ras + (1<<j)], ras |= 1<<j;
        printf ("%s\n", A [ al_k_lea[ras + 1] ] . v . c_str());
        continue;
    }

    gets (actual + 1);
    if (ap[pos[i]] == 0)
        ap[pos[i]] = 1, U (pos[i]);
}

return 0;
}