#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	string str;
	int day = 0;
	vector<vector<string>> vec;
	vector<VI> queries;
	while (cin >> str)
	{
		if (str == "<text>")
		{
			vec.PB({});
			queries.PB({});
			continue;
		}
		if (str == "</text>")
		{
			day++;
			continue;
		}
		if (str == "<top")
		{
			int n;
			cin >> n;
			queries.back().PB(n);
			cin >> str;
			assert(str == "/>");
			continue;
		}
		if (SZ(str) >= 4)
			vec[day].PB(str);
	}
	map<string, int> cnt;
	set<pair<int, string>> se;
	auto updCnt = [&](const string& s, int d)
	{
		se.erase({-cnt[s], s});
		cnt[s] += d;
		if (cnt[s] != 0)
			se.insert({-cnt[s], s});
	};
	FOR(i, 0, SZ(vec))
	{
		for (const string& s : vec[i])
		{
			updCnt(s, 1);
		}
		if (i >= 7)
		{
			for (const string& s : vec[i - 7])
			{
				updCnt(s, -1);
			}
		}
		for (int n : queries[i])
		{
			cout << "<top " << n << ">\n";
			int j = 0, lastC = 0;
			for (const auto& [c, s] : se)
			{
				if (j < n || c == lastC)
					cout << s << " " << -c << "\n";
				else
					break;
				if (j == n - 1)
					lastC = c;
				j++;
			}
			cout << "</top>\n";
		}
	}
	return 0;
}