output_description: Print the string after the conversion.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      s
attempt: #!/usr/bin/env python3
  from collections import defaultdict
  from collections import deque
  from heapq import heappush, heappop
  import sys
  import math
  import bisect
  import random
  import itertools
  
  sys.setrecursionlimit(10**5)
  stdin = sys.stdin
  bisect_left = bisect.bisect_left
  bisect_right = bisect.bisect_right
  
  
  def LI():
      return list(map(int, stdin.readline().split()))
  
  
  def LF():
      return list(map(float, stdin.readline().split()))
  
  
  def LI_():
      return list(map(lambda x: int(x) - 1, stdin.readline().split()))
  
  
  def II():
      return int(stdin.readline())
  
  
  def IF():
      return float(stdin.readline())
  
  
  def LS():
      return list(map(list, stdin.readline().split()))
  
  
  def S():
      return list(stdin.readline().rstrip())
  
  
  def IR(n):
      return [II() for _ in range(n)]
  
  
  def LIR(n):
      return [LI() for _ in range(n)]
  
  
  def FR(n):
      return [IF() for _ in range(n)]
  
  
  def LFR(n):
      return [LI() for _ in range(n)]
  
  
  def LIR_(n):
      return [LI_() for _ in range(n)]
  
  
  def SR(n):
      return [S() for _ in range(n)]
  
  
  def LSR(n):
      return [LS() for _ in range(n)]
  
  
  mod = 1000000007
  inf = float("INF")
  
  
  # A
  def A():
      a = input()
      print(" ".join(s.split(",")))
      return
  
  
  # B
  def B():
      return
  
  
  # C
  def C():
      return
  
  
  # D
  def D():
      return
  
  
  # E
  def E():
      return
  
  
  # F
  def F():
      return
  
  
  # G
  def G():
      return
  
  
  # H
  def H():
      return
  
  
  # Solve
  if __name__ == "__main__":
      A()
  
problem_description: Statement
  
  As a New Year's gift, Dolphin received a string s of length 19.  
  The string s has the following format: `[five lowercase English
  letters],[seven lowercase English letters],[five lowercase English letters]`.  
  Dolphin wants to convert the comma-separated string s into a space-separated
  string.  
  Write a program to perform the conversion for him.
samples: [{"input": "happy,newyear,enjoy", "output": "happy newyear enjoy\n    \n\nReplace all the commas in `happy,newyear,enjoy` with spaces to obtain `happy\nnewyear enjoy`.\n\n* * *"}, {"input": "haiku,atcoder,tasks", "output": "haiku atcoder tasks\n    \n\n* * *"}, {"input": "abcde,fghihgf,edcba", "output": "abcde fghihgf edcba"}]