#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <utility>
#include <sstream>
using namespace std;

#define REP(i,n) for (int i=0; i<int(n); i++)
#define FOR(i,a,n) for (int i=a; i<int(n); i++)
#define FORD(i,n) for (int i=int(n)-1; i>=0; i--)
#define pb push_back
#define fi first
#define se second

typedef long long ll;
typedef pair<int, int> pi;
int main()
{
    int n; char c[10000];
    char d[10000], e[100];
    double f;
    while (scanf("%d %s", &n, c) == 2)
    {
	if (n == 0 && string(c) == "END") break;
	vector<string> kto(n);
	vector<double> pon(n);
	vector<bool> typ(n, false);
        REP(i,n)
	{
	    scanf("%s %s %lf", d, e, &f);
	    if (string(e) == "buy") typ[i] = true;
	    pon[i] = f;
	    kto[i] = d;
	}

	cout << c << endl;
	REP(i,n)
	{
	    vector<string> w;
	    REP(j,n) if (typ[j] != typ[i])
	    {
		if (typ[i] && pon[j] <= pon[i])
		    w.push_back(kto[j]);
		if (!typ[i] && pon[j] >= pon[i])
		    w.push_back(kto[j]);
	    }

	    cout << kto[i] << ":";
	    if (w.empty()) cout << " NO-ONE"<<endl;
	    else
	    {
		REP(j,w.size()) cout << " " << w[j];
		cout << endl;
	    }
	}
    }
}