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

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define FILL(a, b) memset(a, b, sizeof(a))
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 1'000'447;
unordered_map<string, int> m;
VI g[2][N];
bool used[2][N];

void dfs(int i, int v)
{
	used[i][v] = 1;
	for (auto& to : g[i][v])
		if (!used[i ^ 1][to])
			dfs(i ^ 1, to);
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	string s;
	getline(cin, s);
	m.reserve(N);
	bool prev = 0;
	int idx = 0;
	vector<PII> v;
	set<char> se;
	se.insert(' ');
	se.insert(',');
	se.insert('.');
	int k = -1;
	FOR (i, 0, SZ(s))
	{
		string word = "";
		while (!se.count(s[i]))
			word += s[i++];
		int j = 0;
		if (m.count(word))
			j = m[word];
		else
			m[word] = j = idx++;
		if (prev)
		{
			v.PB({1, j});
		}
		if (k != -1)
		{
			g[0][k].PB(j);
			g[1][j].PB(k);
		}
		if (s[i] == ',')
		{
			v.PB({0, j});
			prev = 1;
		}
		else
			prev = 0;
		if (s[i] == '.')
			k = -1;
		else
			k = j;
		if (s[i] == ',' || s[i] == '.') i++;
	}
	for (auto [i, u] : v)
		if (!used[i][u])
			dfs(i, u);
	FOR (i, 0, SZ(s))
	{
		string word = "";
		while (!se.count(s[i]))
			word += s[i++];
		int	j = m[word];
		cout << word;
		if (s[i] == ' ' && used[0][j])
		{
			cout << ",";
		}
		cout << s[i];
		if (s[i] == ',' || s[i] == '.') 
		{
			cout << ' ';
			i++;
		}
	}
	cout << '\n';
}