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

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt")

using ll = long long int;
using ull = unsigned long long int;
using vi = vector<ll>;
using ii = pair<ll,ll>;
using vii = vector<ii>;
using ld = long double;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T>
using ordered_set = tree < T, null_type, less<T>,
rb_tree_tag,
tree_order_statistics_node_update >;

#ifdef SA_DEBUG
template <class T>
void print(T a) {cerr << a << endl;}
template <class T, class... V> 
void print(T a, V... b) {cerr << a << ", "; print(b...);}
#define dbg(...) cerr << "[" << __LINE__ << "] " << #__VA_ARGS__ << " :: ", print(__VA_ARGS__)
#else
#define dbg(...) 7
#endif

#define eb emplace_back
#define fi first
#define se second

const ll INFL = 2e18;
const int INF = 1e9;
const double PI = acos(-1);
const ll mod = 1e9+7;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template<class T, class V> 
ostream& operator << (ostream &s, pair<T, V> a){
	s << a.fi << ' ' << a.se; return s;
}

template<class T, class V> 
istream& operator >> (istream &s, pair<T, V> &a){
	s >> a.fi >> a.se; return s;
}

template<class T> 
ostream& operator << (ostream &s, vector<T> a){
	for(int i = 0; i < (int)a.size(); i++){
		if(i > 0)s << ' ' ; 
		s << a[i];
	} return s;
}

template<class T> 
istream& operator >> (istream &s, vector<T> &a){
	for(T &x : a)s >> x; 
	return s;
}

template<class T> 
void input(T a[], int l, int r, istream &s = cin){
	while(l <= r)s >> a[l++];
}

template<class T> 
void output(T a[], int l, int r, bool en = true, ostream &s = cout){
	while(l <= r){ s << a[l++];
		if(l <= r) s << ' ';
	} if(en)s << "\n";
}



const int N = 2e2+3, K = 26;
//====================================================================//

void testcase(){
	vector<vector<string>> days;
	string s;
	multiset<pair<int, string>> ms;
	map<string, int> freq;
	while(cin >> s){
		if(s == "<text>"){
			if(days.size() >= 7){
				for(auto x : days[days.size() - 7]){
					int d = freq[x]--;
					ms.erase(ms.find(make_pair(-d, x)));
					if(d > 1)ms.emplace(-d + 1, x);
				}
			}
			days.eb();
			
			continue;
		}
		if(s == "</text>")continue;
		if(s == "<top"){
			int x;
			cin >> x;
			cin >> s;
			cout << "<top " << x << ">\n";
			int last = INF, cnt = 0;
			auto it = ms.begin();
			while(it != ms.end() && (last == -it -> fi || cnt < x)){
				cout << it -> se << " " << (last = -it -> fi) << "\n";
				cnt++;
				it++;
			}
			cout << "</top>\n";
		}
		if(s.size() <= 3)continue;
		days.back().eb(s);
		int d = freq[s]++;
		if(d > 0)ms.erase(ms.find(make_pair(-d, s)));
		ms.emplace(-d - 1, s);
		//dbg(s);
	}
	
	
	
	return;
}





int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	int T = 1;
	//cin >> T;
	
	for(int qq = 1; qq <= T; ++qq){
		//cout << "Case #" << qq << ": ";
		testcase();
	}
	return 0;
}
/*
6 7
3 2 3
3 5 3
2 2 3
2 6 4
1 1 3
1 4 2
0 1 walking
0 2 lift
1 2 stairs
2 3 walking
3 4 escalator
5 3 escalator
4 5 walking
1
5 1
*/