/*
模拟题
*/
#define LOCAL
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<iomanip>
#include<string>
#include<algorithm>
#include<ctime>
#include<stack>
#include<queue>
#include<vector>
#define N 1005
using namespace std;
class Node
{public:long long qnum,period,record;};
bool cmp(const Node &p,const Node &q)//二级排序
{
if(p.qnum<q.qnum)
return true;
else return false;
}
int main()
{
#ifdef LOCAL
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string temp;int len=0,k,min,i;Node node[N];
while(cin>>temp&&temp!="#")
{
cin>>node[len].qnum>>node[len].period;
node[len].record=node[len].period;len++;
}
sort(node,node+len,cmp);
cin>>k;
while(1)
{
min=node[0].period;
for(i=1;i<len;i++)
{
if(min>node[i].period)
{
min=node[i].period;
}
}
for(i=0;i<len;i++)
{
if(node[i].period==min)
{
cout<<node[i].qnum<<endl;
node[i].period+=node[i].record;
k--;
if(k==0) return 0;
}
}
}
return 0;
}