#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;

const int N = 100'447;
int idx = 1;
int t;
map<string, int> g[N];
int sz[N];

void dfs1(int v)
{
	for (auto [_, to] : g[v])
		dfs1(to);
	for (auto [_, to] : g[v])
		sz[v] += sz[to];
}
string ans;

void dfs2(int v)
{
	bool is_dir = false, is_big = false;
	for (auto [_, to] : g[v])
	{
		is_dir |= !g[to].empty();
		if (!g[to].empty())
			is_big |= sz[to] >= t;
	}
	char c = ' ';
	if (!is_dir)
		c = ' ';
	else if (!is_big)
		c = '+';
	else
		c = '-';
	cout << c << ' ' << ans << ' ' << sz[v] << '\n';
	
	if (c != '-')
		return;
	for (auto [s, to] : g[v])
	{
		if (g[to].empty())
			continue;
		ans += s + "/";
		dfs2(to);
		FOR (i, 0, SZ(s) + 1)
			ans.pop_back();
	}
		
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin >> n;
	FOR (i, 0, n)
	{
		string s;
		cin >> s;
		s += '/';
		int v = 0;
		string s2 = "";
		FOR (j, 1, SZ(s))
		{
			if (s[j] == '/')
			{
				if (!g[v].count(s2))
					g[v][s2] = idx++;
				v = g[v][s2];
				s2 = "";
			}
			else
				s2 += s[j];
		}
		
		int szv;
		cin >> szv;
		sz[v] = szv;
	}
	cin >> t;
	dfs1(0);
	ans = "/";
	dfs2(0);
	return 0;
}