Problem:


Score : 100 points

Problem 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.  

Constraints

The length of s is 19.

The sixth and fourteenth characters in s are ,.

The other characters in s are lowercase English letters.

Input

The input is given from Standard Input in the following format:

s

Output

Print the string after the conversion.

Sample Input 1

happy,newyear,enjoy

Sample Output 1

happy newyear enjoy

Replace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.

Sample Input 2

haiku,atcoder,tasks

Sample Output 2

haiku atcoder tasks

Sample Input 3

abcde,fghihgf,edcba

Sample Output 3

abcde fghihgf edcba



Sample input:
happy,newyear,enjoy


Sample output:
happy newyear enjoy

Submission status: Accepted

Solution code:
s = input()

s_list = s.split(sep=',')
ans = ' '.join(s_list)
print(ans)

Submission status: Accepted

Solution code:
s=str(input())
print(s[0:5]+' '+s[6:13]+' '+s[14:19])

Submission status: Accepted

Solution code:
a, b, c = input().split(",")

print(a,b,c)

Submission status: Accepted

Solution code:
s = input()

print(s.replace(","," "))

Submission status: Accepted

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    s = s_input()

    print(s.replace(',', ' '))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()
s=s.split(",")
print(s[0]+" "+s[1]+" "+s[2])

Submission status: Accepted

Solution code:
A,B,C = map(str,input().split(','))
print(A + ' ' + B + ' ' + C)

Submission status: Accepted

Solution code:
s = input()
print(" ".join(s.split(',')))

Submission status: Accepted

Solution code:
print(*input().split(","))

Submission status: Accepted

Solution code:
x, y, z = input().split(',')
print(x, y, z)

Submission status: Accepted

Solution code:
s=input().split(",")
print(" ".join(s))

Submission status: Accepted

Solution code:
a, b, c = map(str, input().split(','))
print(a + ' ' + b + ' ' + c)

Submission status: Accepted

Solution code:
s = input()

print(' '.join(s.split(',')))

Submission status: Accepted

Solution code:
inp=input()
print(inp.replace(',',' '))

Submission status: Accepted

Solution code:
inp = input().split(',')
for s in inp:
    print(s, end=" ")

Submission status: Accepted

Solution code:
def main():
    s = input()
    print(s.replace(',', ' '))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
lst=input()
print(lst.replace(',',' '))

Submission status: Accepted

Solution code:
print(*str(input()).split(','))

Submission status: Accepted

Solution code:
a,b,c=map(str,input().split(","))
s=a+" "+b+" "+c
print(s)

Submission status: Accepted

Solution code:
import sys
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし

s = LS2()
s[5] = ' '
s[13] = ' '
print(''.join(s))

Submission status: Accepted

Solution code:
import sys
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし

s = LS2()
a = ''.join(s[0:5])
b = ''.join(s[6:13])
c = ''.join(s[14:19])
print('{} {} {}'.format(a,b,c))

Submission status: Accepted

Solution code:
s=input().split(",")
print(f"{s[0]} {s[1]} {s[2]}")

Submission status: Accepted

Solution code:
def resolve():
    s = input()
    print(s.translate(str.maketrans({",": " "})))

resolve()

Submission status: Accepted

Solution code:
s = input().split(',')
print(' '.join(s))

Submission status: Accepted

Solution code:
a = list(input())

a[5] = " "
a[13] =" "
b = "".join(a)
print(b)

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

s = input().split(',')
print(' '.join(s))

Submission status: Accepted

Solution code:
s=input().split(',')
print(*s)

Submission status: Accepted

Solution code:
s = input().split(",")
print('{} {} {}'.format(s[0], s[1], s[2]))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

def main():

    s = input()
    ans = s.replace(',', ' ')

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()
s=s.replace(","," ")
print(s)

Submission status: Accepted

Solution code:
s1, s2, s3 = input().split(",")
print(s1, s2, s3)

Submission status: Accepted

Solution code:
l=list(input().split(","))
print(" ".join(l))

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    s = readline().strip()

    print(s.replace(',', ' '))

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,c = map(str,input().split(","))
print(a,b,c)

Submission status: Accepted

Solution code:
def main():
    s = input()
    print(s.replace(","," "))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s1, s2, s3 = input().split(",")

print(s1, s2, s3)

Submission status: Accepted

Solution code:
a = input()

for i in a:
    if (i != ','):
        print(i, end = "")
    else:
        print(end=" ")
print("");

Submission status: Accepted

Solution code:
*S, = input()
S[5] = S[13] = ' '
print(*S, sep='')

Submission status: Accepted

Solution code:
s = input()
print( s.replace(",", " ") )

Submission status: Accepted

Solution code:
S = input().split(',')
print(' '.join(S))

Submission status: Accepted

Solution code:
S = input()

ans = []
for s in S:
    if s ==",":
        s = " "
    ans.append(s)
print(''.join(ans))

Submission status: Accepted

Solution code:
s = str(input())
l= s.split(',')
print(' '.join(l))

Submission status: Accepted

Solution code:
s = input()
print( s.replace(',', ' ') )

Submission status: Accepted

Solution code:
print(input().replace(',',' '))

Submission status: Accepted

Solution code:
s=input()

print(s.replace(',',' '))

Submission status: Accepted

Solution code:
print(*input().split(","))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5)

# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')

readline = sys.stdin.readline

def process():
    temp_list = readline().rstrip().split(',')
    return ' '.join(temp_list)

# for _ in range(int(readline().rstrip())):
#    print(process())

print(process())

Submission status: Accepted

Solution code:
S= input()
res1 = S[0:5]
res2 = S[6:13]
res3 = S[14:19]
print(res1,res2,res3)

Submission status: Accepted

Solution code:
a = input()
b=a.split(",")


print(b[0]+" "+b[1]+" "+b[2])

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

s = ins()
print(s.replace(",", " "))

Submission status: Accepted

Solution code:
s=input()
s=s.replace(","," ")
print(s)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

s = input()
s = s.replace(',', ' ')
print(s)

Submission status: Accepted

Solution code:
S = input()
print(S.replace(',',' '))

Submission status: Accepted

Solution code:
S = list(input().split(","))
print(*S)

Submission status: Accepted

Solution code:
l = input ().split ()
l = ''.join(list(l))
l = l.replace(',', ' ')
print (l)

Submission status: Accepted

Solution code:
s = str(input())
a = s[0:5]
b = s[6:13]
c = s[14:]
print(a, b, c)

Submission status: Accepted

Solution code:
s=input()
l=list(s)
l[5]=' '
l[13]=' '
i=''.join(l)
print(i)

Submission status: Accepted

Solution code:
s=input().split(",")
print(*s)

Submission status: Accepted

Solution code:
s=input();print(s[:5],s[6:13],s[14:])

Submission status: Accepted

Solution code:
d = input()

print( d[:5] + " " + d[6:13] + " " +d[14:] )

Submission status: Accepted

Solution code:
array = input().split(",")
print(array[0] + " " + array[1] + " " + array[2])

Submission status: Accepted

Solution code:
s = list(input())
s[5] = " "
s[13] = " "
print("".join(s))

Submission status: Accepted

Solution code:
a = input().replace(',',' ')
print(a)

Submission status: Accepted

Solution code:
print(input().replace(*', '))

Submission status: Accepted

Solution code:
s=input()
print(s[:5]+' '+s[6:13]+' '+s[14:])

Submission status: Accepted

Solution code:
s = input()

print(s.replace(',', ' '))

Submission status: Accepted

Solution code:
L = input().split(',')
print(' '.join(L))

Submission status: Accepted

Solution code:
s = input()
a = [s[0:5], s[6:13], s[14:]]
print(' '.join(a))

Submission status: Accepted

Solution code:
import sys
import numpy as np
import random
from decimal import Decimal
import itertools
import re
import bisect
from collections import deque, Counter
from functools import lru_cache

sys.setrecursionlimit(10**9)
INF = 10**13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
def SERIES(n): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ')
def GRID(h,w): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ').reshape(h,-1)[:,:w]
def GRIDfromString(h,w): return np.frombuffer(sys.stdin.buffer.read(), 'S1').reshape(h,-1)[:,:w]
MOD = 1000000007

def main():
	s = S()
	print(s.replace(',',' '))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B, C = input().split(',')
print(A, B, C)

Submission status: Accepted

Solution code:
s=input()
print(*s.split(","))

Submission status: Accepted

Solution code:
s = input()
print(' '.join(s.split(',')))

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    return input().replace(",", " ")


if __name__ == '__main__':
    print(solve())

Submission status: Accepted

Solution code:
s = input().replace(",", " ")
print(s)

Submission status: Accepted

Solution code:
print(" ".join(map(str, input().split(","))))

Submission status: Accepted

Solution code:
# import sys; input = lambda: sys.stdin.readline()
s = input()
s = s.replace(",", " ")
print(s)

Submission status: Accepted

Solution code:
s=input()
s_2=s.replace(",", " ")
print(s_2)

Submission status: Accepted

Solution code:
s=input()
print(s.replace(',', ' '))

Submission status: Accepted

Solution code:
haiku = list(map(str,input().split(",")))
for x in haiku:
  print(x,end=" ")

Submission status: Accepted

Solution code:
s = input()
s2 = list(s)

s2[5] = " "
s2[13] =" "

for i in range(len(s2)):
    print(s2[i], end='')

Submission status: Accepted

Solution code:
print(*(list(input().split(","))))

Submission status: Accepted

Solution code:
s =input()
print(s[:5],s[6:13],s[14:])

Submission status: Accepted

Solution code:
a, b, c = input().split(",")
print(a, b, c)

Submission status: Accepted

Solution code:
s=input()
print(s.replace(",", " "))

Submission status: Accepted

Solution code:
A,B,C = input().split(",")
print(A,B,C)

Submission status: Accepted

Solution code:
a,b,c = map(str,(input().split(",")))
print(a,b,c)

Submission status: Accepted

Solution code:
a,b,c = input().split(",")
print(a,b,c)

Submission status: Accepted

Solution code:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

def main():
    s = input().split(',')

    print(' '.join(s))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

print(s[0:5] + " " + s[6:13] + " " + s[14:19])

Submission status: Accepted

Solution code:
s = input()
s = s.replace(',',' ')
print(s)

Submission status: Accepted

Solution code:
s=input()
print(s[0:5],s[6:13],s[14:19])

Submission status: Accepted

Solution code:
a,b,c=input().split(',')
print(a,b,c)

Submission status: Accepted

Solution code:
s = input()

A = s[:5]
B = s[6:13]
C = s[14:]

str = A + " " + B + " " + C

print(str)

Submission status: Accepted

Solution code:
s = input()
s1 = s.replace(","," ")
print(s1)

Submission status: Accepted

Solution code:
def actual(s):
    return s.replace(',', ' ')

s = input()
print(actual(s))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

l = list(map(str, input().split(',')))

print("{} {} {}".format(*l))

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
s = S()
print(s.replace(',', ' '))

Submission status: Accepted

Solution code:
def main():
    s = input().split(',')
    print(s[0] + ' ' + s[1] + ' ' + s[2])
main()

Submission status: Accepted

Solution code:
s = input()
s = s.replace(",", " ", 3)
print(s)

Submission status: Accepted

Solution code:
s = input().split(",")
print(*s)

Submission status: Accepted

Solution code:

lst = list(map(str,input().split(',')))
print(' '.join(lst))

Submission status: Accepted

Solution code:
s=input()
l=" ".join(s.split(","))
print(l)

Submission status: Accepted

Solution code:
data=input()
x = data.replace(","," ")
print(x)

Submission status: Accepted

Solution code:
a,b,c = input().split(",")

print(a,b,c)

Submission status: Accepted

Solution code:
s=input().split(',')
print(' '.join(map(str,s)))

Submission status: Accepted

Solution code:
text = input()
print(text.replace(",", " "))

Submission status: Accepted

Solution code:
import sys
import re
#X = list(map(str,input().split()))
X = str(input())
print(re.sub(',',' ',X))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
"""
int #整数
float #小数

#標準入力
a=input()
a,b=map(int,input().split()) #入力は行ごと
#標準出力
print(a)
ptrint("Hello")
#for
for name in fruits: #fruitの頭から操作
    print(name)
#リスト
list0 = [] #リスト生成
list0 = [1,2,3,4] #初期化
list0 = [0]*10 #[0,0,0,0,0,0,0,0,0,0]
list1 = list(map(int, input().split()))　# 複数の入力をリストに入れる
list1 = list1 + [6, 7, 8] #リストの追加
list2.append(34) #リストの追加　最後に（）内が足される
list.insert(3,10) #リストの追加　任意の位置（追加したい位置,追加したい値）
len(list4) #リストの要素数
max(sa) #list saの最小値
list5.count(2) #リスト内の2の数
abs(a) #aの絶対値
max(a,b) min(a,b) #最大値　最小値

extension_1 = []
for i in range(10):
    extension_1.append(i)
extension_1
#>>> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

comprehension_1= [i for i in range(10)]
comprehension_1
#>>> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
"""
a,b,c= input().split(",")
print(a+" "+b+" "+c)

Submission status: Accepted

Solution code:
x, y, z = input().split(',')
print(x + ' ' + y + ' ' + z)

Submission status: Accepted

Solution code:
s = str(input()).split(',')
print(*s)

Submission status: Accepted

Solution code:
s = input().split(",")

print(" ".join(s))

Submission status: Accepted

Solution code:
s = input().split(',')

print(' '.join(s))

Submission status: Accepted

Solution code:
s=input()
print(*s.split(','))

Submission status: Accepted

Solution code:
str=input().split(',',3)
print(str[0],str[1],str[2])

Submission status: Accepted

Solution code:
s=input()
ans=[]
for i in str(s):
  if i==",":
    ans.append(" ")
  else:
    ans.append(i)
a="".join(ans)
print(a)

Submission status: Accepted

Solution code:
a = input().split(',')
print(*a)

Submission status: Accepted

Solution code:
s = input()
t = s.split(',')
print(' '.join(t))

Submission status: Accepted

Solution code:
a,b,c=input().split(",")
print(a,b,c)

Submission status: Accepted

Solution code:
s = input()
print(s[:5] + ' ' + s[6:13] + ' ' + s[14:])

Submission status: Accepted

Solution code:
# Vicfred
# https://atcoder.jp/contests/abc051/tasks/abc051_a
# simulation
print(" ".join(input().split(',')))

Submission status: Accepted

Solution code:
a, b, c = input().split(',')

print('{} {} {}'.format(a, b, c))

Submission status: Accepted

Solution code:
a = input()
b = a.replace(',', ' ')

print(b)

Submission status: Accepted

Solution code:
s = input()
print(s.replace(","," "))

Submission status: Accepted

Solution code:
S = input()
print(S.replace(',', ' '))

Submission status: Accepted

Solution code:
s=input()
result=''
for i in s:
    if i==',':
        result+=' '
    else:
        result+=i
print(result)

Submission status: Accepted

Solution code:
s = input()
print(s[:5] + " " + s[6:13] + " " + s[14:])

Submission status: Accepted

Solution code:
s=input()

print(s[:5]+' '+s[6:13]+' '+s[14:])

Submission status: Accepted

Solution code:
for s in input().split(','):
  print(s,end=' ')

Submission status: Accepted

Solution code:
s,t,u = input().split(",")

print(s+" "+t+" "+u)

Submission status: Accepted

Solution code:
s = input()

print(s.replace(',',' '))

Submission status: Accepted

Solution code:
S = list(input())
S[5], S[13] = ' ', ' '
print(''.join(S))

Submission status: Accepted

Solution code:
S = input()
ans = [S[0:5], S[6:13], S[14:22]]
print(' '.join(ans))

Submission status: Accepted

Solution code:
a,b,c = input().split(',')
print(a + ' ' + b + ' ' + c)

Submission status: Accepted

Solution code:
a,b,c = map(str,input().split(','))
print(a,b,c)

Submission status: Accepted

Solution code:
s_in = input()
s_out = s_in.replace(",", " ", 2)
print(s_out)

Submission status: Accepted

Solution code:
s = list(map(str, input().split(',')))
print(' '.join(s))

Submission status: Accepted

Solution code:
s = input().split(',')
print(s[0],s[1],s[2])

Submission status: Accepted

Solution code:
s=input().split(",")
print(s[0],s[1],s[2])

Submission status: Accepted

Solution code:
print(input().replace(",", " "))

Submission status: Accepted

Solution code:
def main():
    s = input()
    l = s.split(',')
    print(" ".join(l))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
s = s.replace(',', ' ')
print(s)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = input()
print(s.replace(',', ' '))

Submission status: Accepted

Solution code:
s=input()
print(s.replace(',',' '))

Submission status: Accepted

Solution code:

s=input().split(",")
l=" ".join(s)
print(l)

Submission status: Accepted

Solution code:
a = input().split(",")

for i in range(3):
  print(a[i],end=" ")

Submission status: Accepted

Solution code:
print(" ".join(input().rstrip().split(",")))

Submission status: Accepted

Solution code:
s =input()
print(s[:5]+" "+s[6:13]+" "+s[14:])

Submission status: Accepted

Solution code:
a=input()
print(a.replace(',',' '))

Submission status: Accepted

Solution code:
s=input()
print (s[:5]+' '+s[6:13]+' '+s[14:19])

Submission status: Accepted

Solution code:
s=input()
for i in range(19):
  if s[i]==',':
    print(' ',end='')
  else:
    print(s[i],end='')

Submission status: Accepted

Solution code:
a,b,c = input().split(',')
print(a+' '+b+' '+c)

Submission status: Accepted

Solution code:
print(" ".join(input().split(',')))

Submission status: Accepted

Solution code:
s = input()
print(s.replace(',',' '))

Submission status: Accepted

Solution code:
s = list(input().split(","))
print(*s)

Submission status: Accepted

Solution code:
s = input()

print(s.replace(",", " "))

Submission status: Accepted

Solution code:
s = input() #sys.stdin.readlineは最後が改行
print(s.replace(',',' '))

Submission status: Accepted

Solution code:
a, b, c=map(str, input().split(','))
print(a, b, c)

Submission status: Accepted

Solution code:
s = list(input())
s[5]=s[13]=' '
print(''.join(s))

Submission status: Accepted

Solution code:
s=str(input())
for i in range(len(s)):
    if s[i]==",":
        s=s[:i]+" "+s[i+1:]
print(s)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    L = input().split(',')
    print(' '.join(L))



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
S = input().strip()

print(S.replace(",", " "))

Submission status: Accepted

Solution code:
x = list(input().split(","))
print("{0} {1} {2}".format(x[0], x[1], x[2]))

Submission status: Accepted

Solution code:
s = str(input())

for i in range(len(s)):
  if s[i] == ",":
    s = s[:i]+" "+s[i+1:]
print(s)

Submission status: Accepted

Solution code:
from sys import stdin
def S(): return stdin.readline().rstrip()

s = S()

print(s.replace(',',' '))

Submission status: Accepted

Solution code:
s=input()
print(*s.split(','))

Submission status: Accepted

Solution code:
a, b, c = input().split(",")

print(a, b, c)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    print(input().replace(',',' '))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = input().split(',')

print(*x)

Submission status: Accepted

Solution code:
a, b, c = input().split(sep=',')

print(a, b, c)

Submission status: Accepted

Solution code:
s = list(map(str, input().split(",")))
print(*s)

Submission status: Accepted

Solution code:
s=input()
print (s.replace(","," "))

Submission status: Accepted

Solution code:
S=input()
print(S[0:5],S[6:13],S[14:19])

Submission status: Accepted

Solution code:
s = input().replace(","," ")
print(s)

Submission status: Accepted

Solution code:
a, b, c = input().split(',')
print(a + ' ' + b + ' ' + c)

Submission status: Accepted

Solution code:
l, m, r = input().split(",")
print(l, m, r)

Submission status: Accepted

Solution code:
s=input()
s2=s.replace(","," ")
print(s2)

Submission status: Accepted

Solution code:
def main():
 str =input()
 print(str.replace(',',' '))
  
main()

Submission status: Accepted

Solution code:
a,b,c = input().split(',')
print(a,b,c)

Submission status: Accepted

Solution code:
s = input()
print(*s.split(','))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

a, b, c = input().split(',')

print(a, b, c)

Submission status: Accepted

Solution code:
s = str(input())

def Main(s):
    s = s.replace(',', ' ')
    return s

print(Main(s))

Submission status: Accepted

Solution code:
s = input().split(sep=",")
print(' '.join(s))

Submission status: Accepted

Solution code:
def main():
    s = input()
    ans = s.replace(",", " ")
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 17:35:47 2020

@author: shinba
"""

s = input().split(",")

print(" ".join(s))

Submission status: Accepted

Solution code:
s=input()
s=s.replace(","," ")
print(s)

Submission status: Accepted

Solution code:
s = input()

s = s.replace(',', ' ')
print(s)

Submission status: Accepted

Solution code:
s = input()
print(' '.join(s.split(',')))

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    s = list(input())
    for i in range(len(s)):
        if s[i] == ',':
            s[i] = ' '
    print(''.join(s))

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s=input()
a=list(s.split(","))
print(*a)

Submission status: Accepted

Solution code:

s=input()
a=list(s.split(","))
print(*a)

Submission status: Accepted

Solution code:
s = input()

s = s.replace(',', ' ')
print(s)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
print(input().replace(',', ' '))

Submission status: Accepted

Solution code:
s = input().split(',')
print(*s)

Submission status: Accepted

Solution code:
s = input()
s1 = s[0:5]
s2 = s[6:13]
s3 = s[14:]

print("{} {} {}".format(s1,s2,s3))

Submission status: Accepted

Solution code:
S = input()

ans = S.replace(","," ")

print(ans)

Submission status: Accepted

Solution code:
Sentence = input()
Sentence = Sentence.split(',')
Sentence = ' '.join(Sentence)
print(Sentence)

Submission status: Accepted

Solution code:
Word1, Word2, Word3 = input().split(',')

print(Word1 + ' ' + Word2 + ' ' + Word3)

Submission status: Accepted

Solution code:
s=str(input())
print(s.replace(',', ' '))

Submission status: Accepted

Solution code:
s=str(input())
s=list(s)
s[5]=" "
s[13]=" "
print("".join(map(str, s)))

Submission status: Accepted

Solution code:
a = str(input())
print(a.replace(",", " "))

Submission status: Accepted

Solution code:
s = input()
print(*s.split(","))

Submission status: Accepted

Solution code:
s = input()
result = s.replace(",", " ")

print(result)

Submission status: Accepted

Solution code:
s=list(input().split(','))
for i in s:
    print(i)

Submission status: Accepted

Solution code:
haiku = input().split(",")
print(haiku[0], haiku[1], haiku[2])

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

print(input().replace(",", " "))

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7

s = input().split(",")
print(*s)

Submission status: Accepted

Solution code:
s = input().split(",")
print(" ".join(s))