#include <cstdio>
#include <iostream>
#include <algorithm>using namespace std;struct node {int name,now,times;
};
struct node pos[10001],cur_;class T_heap {private:int n;struct node heap[100010];public:void up(int now){if(now<=1) return ;int next=now>>1;if(heap[now].now!=heap[next].now){if(heap[now].now>heap[next].now){swap(heap[now],heap[next]);up(next);}}else{if(heap[now].name>heap[next].name){swap(heap[now],heap[next]);up(next);}}}void down(int now){int next=now,lc=now<<1,rc=now<<1|1;if(lc<=n){if(heap[lc].now!=heap[next].now){if(heap[lc].now>heap[next].now){next=lc;}}else{if(heap[lc].name>heap[next].name){next=lc;}}}if(rc<=n){if(heap[rc].now!=heap[next].now){if(heap[rc].now>heap[next].now){next=rc;}}else{if(heap[rc].name>heap[next].name){next=rc;}}}if(next!=now){swap(heap[next],heap[now]);down(next);}}void qush(struct node cur_){heap[++n]=cur_;up(n);}void pop(){heap[1]=heap[n--];down(1);}struct node top(){return heap[1];}
};
class T_heap heap;int num,n;char flag[101];bool cmp(struct node som,struct node som_)
{if(som.times!=som_.times) return som.times<som_.times;else return som.name<som_.name;
}int main()
{cin>>flag;while(flag[0]=='T'){cin>>pos[++num].name;cin>>pos[num].times;cin>>flag;}cin>>n;sort(pos+1,pos+num+1,cmp);for(int j=1;j<=n;j++){pos[1].now=pos[1].times*j;heap.qush(pos[1]);}for(int i=2;i<=num;i++){for(int j=1;j<=n;j++){pos[i].now=pos[i].times*j;cur_=heap.top();if(cur_.now!=pos[i].now){if(pos[i].now<cur_.now){heap.pop();heap.qush(pos[i]);}else break;}else{if(cur_.name>pos[i].name){heap.pop();heap.qush(pos[i]);}else break;}}}for(int i=n;i>=1;i--){pos[i]=heap.top();heap.pop();}for(int i=1;i<=n;i++) printf("%d\n",pos[i].name);return 0;
}