#include<iostream>

 #include<cstring>

 #include<queue>

 using namespace std;

 struct node

 {

     int Q_num, Period, Time;

     bool operator < (const node& rhs) const

     {

         return Time>rhs.Time || (Time == rhs.Time && Q_num > rhs.Q_num);

     }

 };

 char s[];

 int main()

 {

     //freopen("D:\\txt.txt", "r", stdin);

     int x, y, k;

     priority_queue<node> q;

     while (cin >> s)

     {

         if (s[] == '#')  break;

         cin >> x >> y;

         node u;

         u.Q_num = x;

         u.Period = y;

         u.Time = y;

         q.push(u);

     }

     cin >> k;

     while (k--)

     {

         node u = q.top();

         q.pop();

         cout << u.Q_num << endl;

         u.Time += u.Period;

         q.push(u);

     }

 }