/*
TASK:music
LANG:C++
*/
#include <iostream>
#include <cstring>
#include <cmath>

using namespace std;
const double EPS = 1e-9;

char nq [10000][10];
double dq [10000];
short N, M, K, next;

short bBigger (double a, double b)
{
    return ((a-b) > EPS);
}

short bEqual (double a, double b)
{
    return (fabs (a-b) < EPS);
}

void listen (int num)
{
    short i = num;
    for (; i < next - 1; i++)
    {
        strcpy (nq [i], nq[i+1]);
        dq [i] = dq[i+1];
    }
    next--;
}

int find_next ()
{
    short i;
    short ret = 0;
    for (i = 0; i < next; i++)
        if (bBigger (dq[i],dq[ret])) ret = i;
    return ret;
}

int main ()
{
    cin >> N;
    short i, j;
    
    for (i = 0; i < N; i++)
    {
        cin >> M;
        for (j = 0; j < M; j++)
        {
            cin >> nq[next] >> dq [next];
            next ++;
        }
        cin >> K;
        for (j = 0; j < K; j++)
            listen (find_next());
    }
    
    cout << nq[find_next()] << endl;    
    return 0;
}

