#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <sstream>
#include <functional>
 
using namespace std;
 
#define F(a,b) for(int a=0;a<b;++a)
typedef long long LL;
 
typedef pair<int,int>P;
int main(){
	string s;
	stringstream ss;
	priority_queue<P,vector<P>,greater<P> >p;
	map<int,int> m;
	while(getline(cin,s)){
		ss << s;
		string a; ss >> a;
		if(a == "#") break;
		int b,c; ss >> b >> c;
		m[b] = c;
		p.push(P(c,b));
		ss.clear();
	}
	int t; cin >> t;
	while(t--){
		P now = p.top(); p.pop();
		cout << now.second << "\n";
		p.push(P(m[now.second] + now.first,now.second));
	}
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y3N0ZGlvPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8Y3N0cmluZz4KI2luY2x1ZGUgPG1hcD4KI2luY2x1ZGUgPHF1ZXVlPgojaW5jbHVkZSA8c3N0cmVhbT4KI2luY2x1ZGUgPGZ1bmN0aW9uYWw+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKI2RlZmluZSBGKGEsYikgZm9yKGludCBhPTA7YTxiOysrYSkKdHlwZWRlZiBsb25nIGxvbmcgTEw7Cgp0eXBlZGVmIHBhaXI8aW50LGludD5QOwppbnQgbWFpbigpewoJc3RyaW5nIHM7CglzdHJpbmdzdHJlYW0gc3M7Cglwcmlvcml0eV9xdWV1ZTxQLHZlY3RvcjxQPixncmVhdGVyPFA+ID5wOwoJbWFwPGludCxpbnQ+IG07Cgl3aGlsZShnZXRsaW5lKGNpbixzKSl7CgkJc3MgPDwgczsKCQlzdHJpbmcgYTsgc3MgPj4gYTsKCQlpZihhID09ICIjIikgYnJlYWs7CgkJaW50IGIsYzsgc3MgPj4gYiA+PiBjOwoJCW1bYl0gPSBjOwoJCXAucHVzaChQKGMsYikpOwoJCXNzLmNsZWFyKCk7Cgl9CglpbnQgdDsgY2luID4+IHQ7Cgl3aGlsZSh0LS0pewoJCVAgbm93ID0gcC50b3AoKTsgcC5wb3AoKTsKCQljb3V0IDw8IG5vdy5zZWNvbmQgPDwgIlxuIjsKCQlwLnB1c2goUChtW25vdy5zZWNvbmRdICsgbm93LmZpcnN0LG5vdy5zZWNvbmQpKTsKCX0KfQ==