#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;

#define x first
#define y second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()

const ld PI = acos((ld) -1);

void run() {
	ll n;
	cin >> n;
	vector<pair<ld, string>> R;
	for (ll i = 0; i < n; i++) {
		string name;
		ll s;
		cin >> name >> s;
		unordered_map<string, ll> M;
		ll bt = 0;
		ll et = 0;
		for (ll j = 0; j < s; j++) {
			string sname;
			ll t, d;
			cin >> sname >> t >> d;
			bt += t;
			ll r = 0;
			for (ll k = 0; k < d; k++) {
				string dname;
				cin >> dname;
				r = max(r, M[dname]);
			}
			r += t;
			M[sname] = r;
			et = max(et, r);
		}
		R.pb({((ld) bt)/et, name});
	}
	sort(all(R));

	for (pair<ld, string> p : R) {
		cout << p.y << endl;
	}
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    run();
    return 0;
}