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

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    string S;
    vector<string> distinct_words;
    map<string, int> words_seen;
    vector<int> words_id;
    vector<char> v;
    int cnt = 0;
    while (cin >> S) {
        const int N = int(S.size());
        char last = S.back();

        if (last == '\n') break;
        else if (last == '.' || last == ',') {
            S = S.substr(0, S.size()-1);
            v.push_back(last);
        } else {
            v.push_back('~');
        }

        if (words_seen.count(S)) {
            words_id.push_back(words_seen[S]);
        } else {
            words_id.push_back(cnt);
            words_seen[S] = cnt++;
            distinct_words.push_back(S);
        }
    }

    int M = int(v.size());
    vector<bool> has_comma(2*cnt);
    
    vector<int> par(2*cnt, -1);

    auto find = [&](int a) -> int {
        while (par[a] >= 0) {
            if (par[par[a]] >= 0) par[a] = par[par[a]];
            a = par[a];
        }
        return a;
    };

    auto merge = [&](int a, int b) -> bool {
        a = find(a), b = find(b);
        if (a == b) return false;
        if (par[a] > par[b]) swap(a, b);
        par[a] += par[b];
        par[b] = a;
        return true;
    };

    for (int i = 0; i+1 < M; ++i) {
        if (v[i] != '.') {
            merge(words_id[i]*2 + 1, words_id[i+1]*2);
        }
    }
    
    for (int i = 0; i+1 < M; ++i) {
        if (v[i] == ',') {
            has_comma[find(words_id[i]*2 + 1)] = true;           
        }
    }

    for (int i = 0; i < M; ++i) {
        cout << distinct_words[words_id[i]];
        if (v[i] == '.') cout << '.';
        else if (has_comma[find(words_id[i]*2 + 1)]) {
            cout << ',';
        }
        cout << ' ';
    }
    cout << '\n';
}