#include "bits/stdc++.h"

using namespace std;
#define forR(i, x) for(int i = 0; i < (x); ++i)
#define REP(i, a, b) for(int i =(a); i < (b); ++i)
#define boost() cin.sync_with_stdio(0); cin.tie(0)
typedef long long ll;
typedef vector<int> vi;
typedef pair<string, bool> node;

signed main(){
    boost();
    vector<string> tokens;
    string s; getline(cin, s);
    int ci = 0;
    bool addLast = false;
    while(ci < s.size()){
        if(s[ci] == ' ') {
            addLast = false;
            ++ci;
        } else if(s[ci] == ',') {
            tokens.push_back(",");
            addLast = false;
            ci += 2;
        } else if(s[ci] == '.') {
            tokens.push_back(".");
            if(ci + 1 == s.size()) ++ci;
            else ci += 2;
            addLast = false;
        } else {
            if(!addLast) {
                tokens.emplace_back();
                tokens.back().push_back(s[ci]);
                addLast = true;
                ++ci;
            } else {
                tokens.back().push_back(s[ci]);
                ++ci;
            }
        }
    }
    // for(string i : tokens) cout << i << '\n';
    vector<string> nocom;
    for(string i : tokens) if(i != ",") nocom.push_back(i);

    map<node, vector<node>> adj;
    set<node> vis;
    vector<node> bfs;

    forR(i, (int) nocom.size() - 1) if(nocom[i] != "." && nocom[i+1] != ".") {
        adj[{nocom[i], true}].push_back({nocom[i+1], false});
        adj[{nocom[i+1], false}].push_back({nocom[i], true});
    }
    forR(i, (int) tokens.size() - 1) if(tokens[i] != "." && tokens[i] != ",") {
        if(i > 0 && tokens[i-1] == ",") {
            bfs.push_back({tokens[i], false});
            vis.insert({tokens[i], false});
        }
        if(i + 1 < tokens.size() && tokens[i+1] == ",") {
            bfs.push_back({tokens[i], true});
            vis.insert({tokens[i], true});
        }
    }
    int tot = 0;
    while(!bfs.empty()){
        node cur = bfs.back();
        bfs.pop_back();
        ++tot;
        assert(tot < 2 * tokens.size() + 10);
        for(node nex : adj[cur]) if(!vis.count(nex)) {
            vis.insert(nex);
            bfs.push_back(nex);
        }
    }

    vector<string> toPrint;
    forR(ci, nocom.size()) {
        string i = nocom[ci];
        if(i == ".") toPrint.push_back(". ");
        else {
            if(vis.count({i, false}) && !toPrint.empty() && toPrint.back() != ", " && toPrint.back() != ". ") {
                toPrint.push_back(", ");
            } else if(!toPrint.empty() && toPrint.back() != ", " && toPrint.back() != ". ") {
                toPrint.push_back(" ");
            }
            toPrint.push_back(i);
        }
    }
    for(string i : toPrint) cout << i;
    cout << '\n';
}