#include <bits/stdc++.h>

using namespace std;

#define iter(v) v.begin(), v.end()
#define SZ(v) int(v.size())
#define pb emplace_back
#define ff first
#define ss second

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#ifdef zisk
void debug(){ cerr << "\n"; }
template<class T, class ... U>
void debug(T a, U ... b){ cerr << a << " ", debug(b...); }
template<class T> void pary(T l, T r) {
	while (l != r) cerr << *l << " ", l++;
	cerr << "\n";
}
#else
#define debug(...) void()
#define pary(...) void()
#endif

template<class A, class B>
ostream &operator<<(ostream &o, pair<A, B> p) {
	return o << '(' << p.ff << ',' << p.ss << ')';
}

int gao(string s, int end) {
	return stoi(s.substr(3, SZ(s) - 3 + end));
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	const int N = 1000005;
	vector<vector<int>> g(N);
	string bug_s;
	while (cin >> bug_s) {
		int bug = gao(bug_s, -1);
		//debug("test", bug);
		string task_s;
		while (cin >> task_s) {
			int task = gao(task_s, task_s.back() == ',' ? -1 : 0);
			g[task].pb(bug);
			if (task_s.back() != ',') break;
		}
	}
	for (int i = 0; i < N; i++) {
		if (g[i].empty()) continue;
		sort(iter(g[i]));
		cout << "CS-" << i << ": ";
		for (int j = 0; j < SZ(g[i]); j++) {
			cout << "CS-" << g[i][j];
			if (j + 1 == SZ(g[i])) cout << "\n";
			else cout << ", ";
		}
	}

}