#include<bits/stdc++.h>
using namespace std;
#define SPEED ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ff first
#define sn second
#define READ freopen("in.txt","r",stdin)
#define WRITE freopen("out.txt","w",stdout);
#define endl "\n"

#define lnd tree[ind<<1]
#define rnd tree[(ind<<1)+1]
#define cnd tree[ind]
#define lndp b,(b+e)>>1,(ind<<1)
#define rndp ((b+e)>>1)+1,e,(ind<<1)+1
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pLL;
const int mx2=2000005;
const int mod=998244353;
const long double EPS=1e-12;
int dir[4][2]={1,0,-1,0,0,-1,0,1};
//ll fact[mx];
//ll bigmod(ll n, ll p)
//{
//    if(p==0)
//        return 1;
//    if(p%2==0)
//    {
//        ll x=bigmod(n,p/2);
//        return (x*x)%mod;
//    }
//    else
//    {
//        ll x=bigmod(n,p-1);
//        return (x*n)%mod;
//    }
//}



const int mx=2000011;
vector<string>v;
int mark[mx];
int mark_end[mx];
map<string, vector<int> > mp;
int etarpor[mx];
int etarage[mx];
int main()
{
    SPEED;
//

    int t=1,tc=1;
//    cin >> t;
    while(t--)
    {
//        cout << "ok" << endl;
       string s;
       getline(cin , s);
       int len = s.length();
       int now = 1;
       int cnt = 0;
       string tmp = "";

       for(int i = 0 ; i < len; i++)
       {
            if(s[i] == ' ')
            {
                v.push_back(tmp);
                int tmp_len = tmp.size();
                tmp = "";

            }
            else
                tmp += s[i];
       }

    v.push_back(tmp);
    mark[0] = 1;
    queue<pair<string, int> >q;
    map<pair<string , int> , int > vis;
    for(int i = 0 ; i < v.size(); i++)
    {

        tmp = v[i];
        int tmp_len = tmp.size();
        string tmp2 = tmp;
        if(tmp[tmp_len - 1]  == '.')
        {
            mark[i + 1]  = 1;
            tmp2.pop_back();
            mark_end[i] = 1;
        }
        else if(tmp[tmp_len - 1] == ',')
        {
            tmp2.pop_back();
            if(vis.find({tmp2,0}) == vis.end()){
                q.push({tmp2, 0});
                vis[{tmp2,0}];
            }
        }
        v[i] = tmp2;
//        cout << v[i] << endl;
        mp[tmp2].push_back(i);

    }
//    cout << "ok" << endl;
    int v_sz = v.size();
    while(!q.empty())
    {
        auto node = q.front();
        q.pop();
        tmp = node.ff;
        int flag = node.sn;
        if(flag == 0)
        {
            for(auto x : mp[tmp])
            {
                if(mark_end[x] == 1)
                    continue;

                etarpor[x] = 1;
                if(x + 1 >= v_sz)
                    continue;

                string tmp2 = v[x + 1];
                if(vis.find({tmp2, 1}) == vis.end())
                {
                    q.push({tmp2, 1});
                    vis[{tmp2, 1}] = 1;
                }
            }
        }
        else
        {
            for(auto x : mp[tmp])
            {
                if(mark[x] == 1)
                    continue;

                etarage[x] = 1;
                if(x - 1 < 0)
                    continue;

                string tmp2 = v[x - 1];
                if(vis.find({tmp2, 0}) == vis.end())
                {
                    q.push({tmp2, 0});
                    vis[{tmp2, 0}] = 1;
                }
            }
        }
    }


    for(int  i = 0 ; i < v_sz; i++)
    {
        if(i == 0)
        {
            cout << v[i];
            if(etarpor[i])
            cout << ",";
            else if(mark_end[i])
            cout << ".";
        }
        else
        {
            cout << " ";
            cout << v[i];
            if(etarpor[i])
            cout << ",";
            else if(mark_end[i])
            cout << ".";
        }
    }






    }

    return 0;
}