/*
TASK:music
LANG:C++
*/
#include <iostream>
#include <algorithm>
using namespace std;

struct A{
    char name[11];
    double ss;
    int reg;
};

A dae[200001];
int n,m,k,i,j,p,q;

bool cmpA(A a,A b){
    if(a.ss>b.ss) return 1;
    if(a.ss==b.ss&&a.reg<b.reg) return 1;
    return 0;
}

int main(){
    cin>>n;
    for(i=1;i<=n;i++,p+=m){
        cin>>m;
        for(j=1;j<=m;j++){
            cin>>dae[p+j].name;
            cin>>dae[p+j].ss;
            dae[p+j].reg=dae[p+j-1].reg+1;
        }
        cin>>k;
        sort(dae+q+1,dae+p+m+2,cmpA);
        q+=k;
    }
    cout<<dae[q+1].name<<"\n";
    return 0;
}

