#include <bits/stdc++.h>
#define rep(i, l, r) for(int i = l; i < r; i++)
#define hrp(i, l, r) for(int i = l; i <= r; i++)
#define rev(i, r, l) for(int i = r; i >= l; i--)
#define int ll
using namespace std;
typedef long long ll;
template<typename tn = int> tn next(void) { tn k; cin>>k; return k; }
#ifndef LOCAL
#define D(...) 0
#define I(...) 0
#endif
const int U = 5e4;
map<string, int> mp;
string rmp[U];
vector<string> tail[U];
signed main(void)
{
    #ifdef LOCAL
	freopen("C:\\Users\\Loxil\\Desktop\\IN.txt", "r", stdin);
//	freopen("C:\\Users\\Loxil\\Desktop\\OUT.txt", "w", stdout);
    #endif
    
    int cnt = 0;
    string str;
    while(getline(cin, str))
    {
        string cur, head;
        vector<string> s;
        int pos = -1;
        while(++pos < str.size())
        {
            if (str[pos] == ' ') continue;
            if (str[pos] == ':') { head = cur; cur.clear(); continue; }
            if (str[pos] == ',') { s.push_back(cur); cur.clear(); continue; }
            cur += str[pos];
        }
        s.push_back(cur);
        
        for(auto st: s)
        {
            if (!mp[st]) mp[st] = ++cnt, rmp[cnt] = st;
            tail[mp[st]].push_back(head);
        }
    }

    hrp(i, 1, cnt)
    {
        cout<<rmp[i]<<": ";
        rep(j, 0, tail[i].size())
        {
            cout<<tail[i][j];
            if (j != tail[i].size()-1) cout<<", ";
        }
        cout<<endl;
    }
    
    
    return 0;
}
/*
CS-20: CS-1
CS-100: CS-239
CS-300: CS-239, CS-11111
 */