#include<bits/stdc++.h>
using namespace std;

int main(){
   // freopen("in.in", "r", stdin);
    string S;
    map<string, vector<string>> mp;
    vector<string> ans;
    while(getline(cin, S)){
        istringstream ist(S);
        string st, bug;
        int ok = 0;
        while(ist >> st){
            if(!ok) bug = st, ok = 1;
            else{
                if(st.back() == ','){
                    mp[st.substr(0, st.length() - 1)].push_back(bug);
                    ans.push_back(st.substr(0, st.length() - 1));
                }
                else {
                    mp[st].push_back(bug), ans.push_back(st);
                }
            }
        }
    }
    sort(ans.begin(), ans.end(), [&](string x, string y){
        int a = 0, b = 0;
        for(int i = x.length() - 1;i >= 3;i --){
            a *= 10;
            a += x[i] - '0';
        }
        for(int i = y.length() - 1;i >= 3;i --){
            b *= 10;
            b += y[i] - '0';
        }
        return a < b;
    });
    ans.resize(unique(ans.begin(), ans.end()) - ans.begin());
    for(auto key : ans){
        for(int i = 0;i < key.length();i ++) if(key[i] != ',') cout << key[i];
        cout << ": ";

        sort(mp[key].begin(), mp[key].end(), [&](string x, string y){
            int a = 0, b = 0;
            for(int i = x.length() - 1;i >= 3;i --){
                a *= 10;
                a += x[i] - '0';
            }
            for(int i = y.length() - 1;i >= 3;i --){
                b *= 10;
                b += y[i] - '0';
            }
            return a < b;
        });
        
        for(int i = 0;i < mp[key].size();i ++){
            for(int j = 0;j < mp[key][i].length();j ++){
                if(mp[key][i][j] != ':') cout << mp[key][i][j];
            }
            if(i  + 1 < mp[key].size()) cout << ", ";
            else cout << '\n';
        } 
    }
}