#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <sstream>
#include <string>
#include <utility>

using namespace std;
using par = pair<int, int>;
const int N = 1e5 + 3;
int T;
int n, num;


void work(){
	string s;
	map <int,int> id,p;
	map<int,vector<int>> adj;
	int cnt = 0;
	while(getline(cin, s)){
		istringstream input_stream(s);
		string s1; char c; int fa, son;
		input_stream >> c >> c >> c >> fa >> c;
		while(input_stream >> c >> c >> c >> son){
			if(!id.count(son)) {
				id[son] = ++cnt;
				p[cnt] = son;
			}
			adj[id[son]].push_back(fa);
			input_stream >> c;
		}
	}
	for(int i = 1;i <= cnt;i++){
		if(i != 1) cout << " \n";
		cout << "CS-" << p[i] << ": ";
		for(int j = 0;j < (int)adj[i].size();j++) {
			if(j) cout << ", ";
			cout << "CS-" << adj[i][j];
		}
//		sort(v.begin(), v.end());
//		for(auto y : v)
//			out.push_back(y);
//		
//		if(!out.empty()){
//			cout << "CS-" << x << ": ";
//			int sz = out.size();
//			for(int i = 0; i < sz; ++i)
//				cout << "CS-" << out[i] << ","[i == sz-1] << " "[i == sz-1];
//		}
	}
}


int main(){
//	freopen("test.txt", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	while(T--){
		work();
	}	
	return 0;
}