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: Runtime Error

Solution code:
ks= list(map(int, input().split())) 

count = 0

x = 0
y = 0
z = 0

for targetX in range(ks[1]+1):
    
    if targetX <= ks[0]:
    
        for targetY in range(ks[1]+1):
            
            if targetY <= ks[0]:
        
                for targetZ in range(ks[1]+1):
                
                    if targetZ <= ks[0]:
                        if targetX + targetY + targetZ == ks[1]:
                        
                            count +=1
                    
                    targetZ +=1
        
            targetY +=1
        
    targetX +=1
        

#print(ks)
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s,t,u=map(int,input().split(','))
print(s,t,u)

Submission status: Runtime Error

Solution code:
s,t,u=map(int,input().split(''))
print(s,t,u)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

a,b,c = int(input().split(,))
print(a,b,c)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
k, s = map(int, input().rstrip("\n").split())
print(sum([x + y + z == s for x in range(k + 1) for y in range(k + 1) for z in range(k + 1)]))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()
print(s[0:5]+" "+s[5:12]+" "s[12:19])

Submission status: Runtime Error

Solution code:
Tmp = []
Tmp = input().rstrip().split(',')
 
sA = (Tmp[0])
sB = (Tmp[1])
sC = (Tmp[2])
 
print(sA + ' ' + sB ' ' + sC)

Submission status: Runtime Error

Solution code:
k, s = [int(x) for x in input().split()]
k += 1

count = 0

for x in range(k):
    for y in range(k):
        for z in range(k):
            if x + y + z == s:
                count += 1

print(count)

Submission status: Runtime Error

Solution code:
import sys
ks = list(map(int, input().split()))
k = ks[0]
s = ks[1]
ans = 0
for x in range(k+1):
  for y in range(k+1):
    if s - x - y <= k and s - x - y >=0:
      ans = ans + 1
      
print(ans)

Submission status: Runtime Error

Solution code:
a,s,d=input(),split(',')
print(a,s,d)

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())
count = 0
if K*3 < S:
    print(count)
else:
    for i in range(K, -1, -1):
        X = i
        YZ = S - X
        for j in range(K, -1, -1):
            Y = j
            Z = YZ - Y
            if Z > K:
                continue
            elif Z < 0:
                continue
            else:
                count += 1
                #print(X,Y,Z)
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)

using namespace std;
typedef long long ll;
using Graph =vector<int>;
typedef pair<ll,int> P;

const ll MAX_N=131072;
int bit[MAX_N*2-1];
ll n;
int main(){
  string s;
  cin >>s;
  string t;
  rep(i,s.size()){
    if (s[i]==',') t+=' ';
    else t+=s[i];
  }
  cout <<t<<endl;
}

Submission status: Runtime Error

Solution code:
s = input()

s.replave(",", " ")

print(s)

Submission status: Runtime Error

Solution code:
k, s = map(int, input().split())

ans = 0

for x in range(k+1):
    for y in range(k+1):
        if 0 <= s-x-y <= k:
            ans += 1

print(ans)

Submission status: Runtime Error

Solution code:
k, s = map(int, input().split())

ans = 0

num_list = [i for i in range(0, k+1)]
num_list2 = [i+j for i in range(0, k+1) for j in range(0, k+1)]

for num in num_list2:
    l, r = 0, k
    t = s - num
    while l <= r:
        m = (l+r) // 2
        if num_list[m] == t:
            ans += 1
            break
        elif num_list[m] < t:
            l = m + 1
        elif num_list[m] > t:
            r = m - 1

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#!/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()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())

ans = 0
for i in range(0, min(S, K)+1):
    for j in range(0, min(S-i, K)+1):
        if S-i-j <= K:
            ans += 1

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = input().str()

a = a.replace(",", " ")

print(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
K,S=map(int, input().split())
cnt=0
for i in range(K+1):
  X=i
  for j in range(K+1):
    if X + 2K < S:
      break
    Y=j
    if S-(X+Y)in range(K+1):
      cnt+=1
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = list(map(int,input().split()))
num=0
for l in range(a[0]+1):
    for m in range(a[0]+1):
        if(a[1]-l-m <= a[0]):
            num+=1
print(num)

Submission status: Runtime Error

Solution code:
a = list(map(int,input().split()))
num=0
for l in range(a[0]+1):
    for m in range(a[0]+1):
        if(a[1]-l-m <= a[0]):
            num+=1

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())

count = 0
z = 0
for x in reversed(range(0,K+1)):
  for y in reversed(range(0,K+1)):
    z = S - x - y
    if z >= 0 and z <= K:
      count = count + 1
          
print(count)

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())

count = 0
z = 0
flag = False
for x in reversed(range(0,K+1)):
  for y in reversed(range(0,K+1)):
    if S <= x + y:
      count = count + K
      break
    for z in reversed(range(0,K+1)):
      if S == x + y + z: 
        count = count + 1
        break
    
          
print(count)

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())

count = 0
z = 0
flag = False
for x in reversed(range(0,K+1)):
  for y in reversed(range(0,K+1)):
    if S < x + y:
      count = count + K
      break
    for z in reversed(range(0,K+1)):
      if S == x + y + z:   
        count = count + (K-z+1)
        break
    
          
print(count)

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())

count = 0
for x in range(0,K+1):
  for y in range(0,K+1):
    if S >= x + y:
      count = count + 1
    else:
      for z in range(0,K+1):
        if S == x + y + z:
          count = count + 1
          
print(count)

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())

count = 0
for x in range(0,K+1):
  for y in range(0,K+1):
    if S == x + y:
      count = count + 1
    else:
      for z in range(0,K+1):
        if S == x + y + z:
          count = count + 1
          
print(count)

Submission status: Runtime Error

Solution code:
K,S=map(int,input().split())
sum=0
count=0
for i in range(K+1):
    sum+=i
    a=sum
    L=S-sum
    #print(L)
    LL=min(L,K)
    for j in range(LL+1):
        sum+=j
        if S-sum>=0 and S-sum<=K :
            count+=1
            #print(str(i)+" "+str(j))
        sum=a #jを足す前に戻す
    sum=0
print(count)

Submission status: Runtime Error

Solution code:

k,s = map(int,input().split())

count = 0

for x in range(0,k+1):
    #print(x)
    for y in range(0,k+1):
        #print(y)
        if 0 <= (s-x-y) and (s-x-y) <= k:
            count += 1
print(count)

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <string>
using namespace std;

int main(){
    string input_str;

    cin >> input_str;

    input_str[5] = ' ', input_str[13] = '';

    cout << input_str << endl;

    return 0;
}

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <string>
using namespace std;

int main(){
    string input_str;

    cin >> input_str;

    for (int i=0; i < input_str.size(); i++){
        if (input_str[i] == ',') input_str[i] = ' ';
    }

    cout << input_str << endl;

    return 0;
}

Submission status: Runtime Error

Solution code:
k,s=map(int,input().split())

count=0

for i in range(k+1):
    for j in range(k+1):
        z=s-(i+j)
        
        if 0<=z<=s:
            count+=1
print(count)

Submission status: Runtime Error

Solution code:
k,s=map(int,input().split())
ans=0
for i in range(k+1):
    for j in range(k+1):
        if 0<=(s-i-j)<=k:
            ans+=1
print(ans)

Submission status: Runtime Error

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

k, s = map(int, input().split())

ans = 0

for i in range(k+1):
    for j in range(k+1):
        k2 = s - j - i
        if 0 <= k2 <=k:
            ans += 1

        # あれTLEだ
        # if k2 > k or k2 < 0:
        #     continue
        # if s == i + j + k2:
        #     ans += 1

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(s[0:4:1],s[6:12:1],s[14:18:1])

Submission status: Runtime Error

Solution code:
print([" " if i=="," or i for i in input()])

Submission status: Runtime Error

Solution code:
K,S = map(int,input().split())
count=0

for x in range(K+1):
    for y in range(K+1):
        if 0 <= S-x-y <= K:
                count += 1

print(count)

Submission status: Runtime Error

Solution code:
N, M = map(int, input().split())

ABC = []
for _ in range(M):
    a, b, c = map(int, input().split())
    ABC.append((a, b, c))

edges = ABC[:]

from collections import deque, namedtuple


# we'll use infinity as a default distance to nodes.
inf = 1000*1000*10
Edge = namedtuple('Edge', 'start, end, cost')


def make_edge(start, end, cost=1):
  return Edge(start, end, cost)


class Graph:
    def __init__(self, edges):
        # let's check that the data is right
        wrong_edges = [i for i in edges if len(i) not in [2, 3]]
        if wrong_edges:
            raise ValueError('Wrong edges data: {}'.format(wrong_edges))

        self.edges = [make_edge(*edge) for edge in edges]

    @property
    def vertices(self):
        return set(
            sum(
                ([edge.start, edge.end] for edge in self.edges), []
            )
        )

    def get_node_pairs(self, n1, n2, both_ends=True):
        if both_ends:
            node_pairs = [[n1, n2], [n2, n1]]
        else:
            node_pairs = [[n1, n2]]
        return node_pairs

    def remove_edge(self, n1, n2, both_ends=True):
        node_pairs = self.get_node_pairs(n1, n2, both_ends)
        edges = self.edges[:]
        for edge in edges:
            if [edge.start, edge.end] in node_pairs:
                self.edges.remove(edge)

    def add_edge(self, n1, n2, cost=1, both_ends=True):
        node_pairs = self.get_node_pairs(n1, n2, both_ends)
        for edge in self.edges:
            if [edge.start, edge.end] in node_pairs:
                return ValueError('Edge {} {} already exists'.format(n1, n2))

        self.edges.append(Edge(start=n1, end=n2, cost=cost))
        if both_ends:
            self.edges.append(Edge(start=n2, end=n1, cost=cost))

    @property
    def neighbours(self):
        neighbours = {vertex: set() for vertex in self.vertices}
        for edge in self.edges:
            neighbours[edge.start].add((edge.end, edge.cost))

        return neighbours

    def dijkstra(self, source, dest):
        assert source in self.vertices, 'Such source node doesn\'t exist'
        distances = {vertex: inf for vertex in self.vertices}
        previous_vertices = {
            vertex: None for vertex in self.vertices
        }
        distances[source] = 0
        vertices = self.vertices.copy()

        while vertices:
            current_vertex = min(
                vertices, key=lambda vertex: distances[vertex])
            vertices.remove(current_vertex)
            if distances[current_vertex] == inf:
                break
            for neighbour, cost in self.neighbours[current_vertex]:
                alternative_route = distances[current_vertex] + cost
                if alternative_route < distances[neighbour]:
                    distances[neighbour] = alternative_route
                    previous_vertices[neighbour] = current_vertex

        path, current_vertex = deque(), dest
        while previous_vertices[current_vertex] is not None:
            path.appendleft(current_vertex)
            current_vertex = previous_vertices[current_vertex]
        if path:
            path.appendleft(current_vertex)
        return path

#print(edges)
# 無効グラフなので逆向きのエッジも作る
rev_edges = [ (b,a,c) for a,b,c in edges ]
graph = Graph(edges + rev_edges)

shotest_set = set()
for a in range(1, N+1):
    for b in range(a+1, N+1):
        shortest = graph.dijkstra(a, b)
        shortest = list(shortest)
        print(shortest)
        for x, y in zip(shortest[:-1],shortest[1:]):
            x, y = min(x, y), max(x, y)
            shotest_set.add((x,y))

#print(edges)
#print(shotest_set)
print(len(edges) - len(shotest_set))

Submission status: Runtime Error

Solution code:
K,S=map(int,input())
cnt = 0
for x in range(K+1):
  for y in range(K+1):
    if 0 <= S-x-y <= K
      cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
#%%
k, s = map(int,input().split())


#%%
count = 0
for x in range(k + 1):
    for y in range(k - x +1):
        if x + y + (k-x-y) == s:
            count += 1
print(count)

Submission status: Runtime Error

Solution code:
sx,sy,tx,ty=map(int,input().split())
x=tx-sx
y=ty-sy
ans=""

ans="U"*x + "R"*y
ans+="D"*x + "L"*y

ans+="L"+"U"*(x+1)+"R"*(x+1)+"D"
ans+="R"+"D"*(x+1)+"L"*(y+1)+"U"
print(ans)

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())

count = 0
for x in range(0,K):
    for y in range(0,K):
        a = S-x-y
        if a <= K and a>= 0:
            count += 1
print (count)

Submission status: Runtime Error

Solution code:
k, s = list(map(int, input().split()))
ct = 0
for x in range(k+1):
    for y in range(k+1):
        z = s - x - y
        if 0 <= z <= k:
            ct += 1
print(ct)

Submission status: Runtime Error

Solution code:
k, s = list(map(int, input().split()))
ct = 0
for x in range(k+1):
    for y in range(x, k+1):
        if x + y > s:
            break;
        for z in range(y, k+1):
            if x + y + z == s:
                if x == y and y == z:
                    ct += 1
                elif x != y and y != z:
                    ct += 6
                else:
                    ct += 3
                break;
print(ct)

Submission status: Runtime Error

Solution code:
k, s = list(map(int, input().split()))
ct = 0
for x in range(k+1):
    for y in range(k+1):
        for z in range(k+1):
            if x + y + z == s:
                ct += 1
                break;
print(ct)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b, c = input().split(sep = ", ")
if(len(a) == 7):
    print(b.lower() + " " + a.lower() + " " + c.lower())
elif(len(b) == 7):
    print(a.lower() + " " + b.lower()  + " " + c.lower())
elif(len(c) == 7):
    print(a.lower() + " " + c.lower() + " " + b.lower*(()

Submission status: Runtime Error

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

print(a + " " + b + " " + c)

Submission status: Runtime Error

Solution code:
sx, sy, tx, ty = map(int, input().split())
dx, dy = tx - sx, ty - sy

ans = "" 
ans += 'U' * dy + 'R' * dx 
ans += 'D' * dy + 'L' * dx
ans += 'L'
ans += 'U' * (dy + 1) + 'R' * (dx + 1)
ans += 'D'
ans += 'R'
ans += 'D' * (dy + 1) + 'L' * (dx + 1)
ans += 'U'

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,c = map(int().split(","))
print(A,b,c)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=str(input())
s1=str[:5]
s2=str[6:13]
s3=str[14:]
print('{} {} {}'.format(s1,s2,s3))

Submission status: Runtime Error

Solution code:
s=str(input())
s1=str[:5]
s2=str[6:12]
s3=str[14:]
print('{} {} {}'.format(s1,s2,s3))

Submission status: Runtime Error

Solution code:
s=input()
print(s.strip(,))

Submission status: Runtime Error

Solution code:
def main(input_str):
    nums = list(map(int, input_str.split()))

    count = 0
    for num_1 in range(nums[0]+1):
        for num_2 in range(nums[0]+1):
            for num_3 in range(nums[0]+1):
                result = num_1 + num_2 + num_3
                if result == nums[1]:
                    count += 1

    return len(count)


if __name__ == "__main__":
    input_str = input()
    print(main(input_str))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = Input()
r1 = s[0:4]
r2 = s[6:12]
r3 = s[14:]
print("{} {} {}".format(r1, r2, r3))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split());print(sum(a>=b-s-t>=0for t in range(a+1)for s in range(a+1)))

Submission status: Runtime Error

Solution code:
s=input()
s[7]=" "
s[15]=" "
print(s)

Submission status: Runtime Error

Solution code:
l=list(input())
l[5]=""
l[12]=""
print(sum(l))

Submission status: Runtime Error

Solution code:
s=input()

s.raplace(","," ")
print(s)

Submission status: Runtime Error

Solution code:
str(s)
s=input()

s.raplace(","," ")
print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=str(input())
s[5]=" "
s[13]=" "
print(s)

Submission status: Runtime Error

Solution code:
import numpy as np
import sys

x = [[int(i) for i in input().split()] for j in range(1)]
k = x[0][0]
s = x[0][1]


#k = 5
#s = 15

count = 0
for x in range(k+1):
    if x == s:
        count = count + 1
        break
    if x + k < s:
        count = count
    if 2*k + x >= s:
        count = count + 1
    if s <= x + k:
        count = count + (s-x+1)

print(count)

Submission status: Runtime Error

Solution code:
import numpy as np
import sys

x = [[int(i) for i in input().split()] for j in range(1)]
k = x[0][0]
s = x[0][1]


#k = 5
#s = 15

count = 0
for x in range(k+1):
    if s < x:
        break
    for y in range(k+1):
        if s < x + y:
            break
        if x + 2*k < s:
            break
        for z in range(k+1):
            if x + y + z == s:
                count = count + 1
                break
            if x + y + k < s:
                break

print(count)

Submission status: Runtime Error

Solution code:
import numpy as np
import sys

x = [[int(i) for i in input().split()] for j in range(1)]
k = x[0][0]
s = x[0][1]


#k = 5
#s = 15

count = 0
for x in range(k+1):
    if s < x:
        break
    for y in range(k+1):
        if s < x + y:
            break
        for z in range(k+1):
            if x + y + z == s:
                count = count + 1
                break
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = input().split(',')
ans = ""
for i in a:
  ans += a[i] + " "
ans -= " "
print(ans)

Submission status: Runtime Error

Solution code:
K, S = map(int, input().split())

counter = 0
for x in range(K + 1):
    for y in range(K + 1):
        z = S - x - y
        if 0 <= z and z <= K:
            counter += 1
print(counter)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
"""ABC051_B
"""
K, S = map(int, input().split())

counter = 0
for x in range(K + 1):
    for y in range(K + 1):
        z = S - x - y
        if 0 <= z and z <= K:
            counter += 1
print(counter)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=input().split()
print(a[0:4]+" "+a[6:12]+" "+a[13:17])

Submission status: Runtime Error

Solution code:
K,S=map(int,input().split())
num=0
for i in range(K+1):
    for j in range(K+1):
        if 0<=S-i-j<=K:
            num+=1
print(num)

Submission status: Runtime Error

Solution code:
# ABC 051 B - Sum of Three Integers　
li = list(map(int,input().split()))
k = li[0]
s = li[1]
cnt =0
for x in range(k+1):
    for y in range(k+1):
        z = s-x-y
        if 0<= z <= k: 
            cnt+=1
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
K, S = map(int,input().split())
count = 0
for x in range(0,K+1,1):
  for y in range(0,K+1,1):
    z = S - x - y
    print(x,y,z)
    if x+y+z == S and z <= K and z >= 0:
      count += 1
print(count)

Submission status: Runtime Error

Solution code:
k,s=map(int,input().split(" "))
c=0
for i in range(k+1):
  for j in range(k+1):
    if i+j>s:
      break
    for l in range(k+1):
      if i+j+l==s:
        c+=1
      if i+j+l>s:
        break
print(c)

Submission status: Runtime Error

Solution code:
l     = input().split()
K, S  = map(int, l)
max   = K+1
count = 0


for x in range(0, max):
    for y in range(0, max):
            z = S - x - y
            if 0 <= z <= K :
                count +=1

print(count)

Submission status: Runtime Error

Solution code:
l     = input().split()
K, S  = map(int, l)
max   = K+1
count = 0


for x in range(0, max):
    for y in range(0, max):
            z = S - x - y
            if 0 <= z <= K :
                count +=1

print(count)

Submission status: Runtime Error

Solution code:
k,s=map(int,input().split());r=range(k+1);print(sum(0<=s-x-y<=k for x in r for y in r))

Submission status: Runtime Error

Solution code:
k,s=map(int,input().split());r=range;print(sum(1for x in r(k+1)for y in r(k+1)if 0<=s-x-y<=k))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
K,S = map(int,input().split())
count = 0
for i in range(K+1):
    for j in range(K+1):
        for k in range(K+1):
            if i+j+k == S:
                count += 1
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x1,y1,x2,y2 = map(int ,input().split())
x = x2 - x1
y = y2 - y1
ans = ''
a = 'U'
b = 'D'
c = 'R'
d = 'L'


for _ in range(y):
    ans += a
for _ in range(x):
    ans += c
for _ in range(y):
    ans += b
for _ in range(x) :
    ans += d
ans += d
for _ in range(y + 1):
    ans += a
for _ in range(x +1):
    ans += c
ans += b
ans += c
for _ in range(y + 1):
    ans += b
for _ in range(x + 1):
    ans += d
ans += a
    print(ans)

Submission status: Runtime Error

Solution code:
K,S = map(int,raw_input().split())
Count = 0
for x in range(K+1):
  for y in range(K+1):
    for z in range(K+1):
      if x+y+z==S:
        Count +=1
print Count

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()
print("{} {} {}".format( s[0,5], s[6,13],s[14,19] ) )

Submission status: Runtime Error

Solution code:
s=list(input()
print("{} {} {}".format( s[0,5], s[6,13],s[14,19] ) )

Submission status: Runtime Error

Solution code:
s=input()
print(f"{} {} {}".format( s[0,5], s[6,13],s[14,19] ) )

Submission status: Runtime Error

Solution code:
k,s = [int(x) for x in input().split()]
a = 0
n = 0
while a <= k:
  b = 0
  while b <= k:
    z = s-a-b
    if 0<=z and z <= k:
      n += 1
    b += 1
  a += 1
print(n)

Submission status: Runtime Error

Solution code:
k,s = [int(x) for x in input().split()]
ans = 0
for x in range(k+1):
    for y in range(x, k+1):
        z = s - x - y
        if x <= y <= z <= k:
            ans += [ None, 1, 3, 6 ][ len(set([ x, y, z ])) ]

Submission status: Runtime Error

Solution code:
k,s = input().split()
a = 0
n = 0
while a <= k:
  b = 0
  while b <= k:
    c = 0
    while c <= k:
      if (a+b+c) == s:
        n += 1
      c += 1
    b += 1
  a += 1
print(n)

Submission status: Runtime Error

Solution code:
N,M=map(int,input().split())
Islands=[[] for i in range(N)]
Edge=[]
S=0
for i in range(M):
  a,b,c=map(int,input().split())
  Islands[a-1].append([b-1,c])
  Islands[b-1].append([a-1,c])
  Edge.append([a-1,b-1,c])
for m in range(M):
  a=Edge[m][0]
  b=Edge[m][1]
  c_m=Edge[m][2]
  List=[[a,0]]
  for l in List:
    c_base=l[-1]
    c=c_base
    if l[-2]==b:
      if c_m>c:
        S+=1
        break
    else:        
      for n in Islands[l[-2]]:
        if n[0] in l[0:-1]:
          pass
        else:
          c+=n[1]
          List.append(l[0:-1]+[n[0],c])  
          c=c_base
print(S-1)

Submission status: Runtime Error

Solution code:
import heapq

n, m = [int(i) for i in input().split()]
inf = 10**10
path = [[0] * n for _ in range(n)]
Q = [[inf] * n for _ in range(n)]
ans = 0
pathnum = []
ctr = 0

for i in range(m):
    a, b, c = map(lambda x: int(x)-1 ,input().split())    
    path[a][b] = path[b][a] = c+1
    pathnum.append((a,b))

for i in range(n):
    decided = [False for _ in range(n)]
    H = []
    Q[i][i] = 0
    heapq.heappush(H,(0,i))
    while ctr != n:
        while True:
            k = heapq.heappop(H)
            k = k[1]
            if not decided[k]:
                decided[k] = True
                ctr += 1
                break
        for j in range(n):
            if path[k][j] == 0:
                continue
            if decided[j]:
                continue
            Q[i][j] = min(Q[i][k] + path[k][j], Q[i][j])
            heapq.heappush(H,(Q[i][j],j))

for i in pathnum:
    if Q[i[0]][i[1]] == inf:
        continue
    elif Q[i[0]][i[1]] != path[i[0]][i[1]]:
        ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
# Your code here!
aa=gets().chomp
b=aa.length
cc=aa.unpack("C*")
#puts(aa,cc)
for i in 0..(b-1)
    #puts(i,aa[i],cc[i])
    if cc[i]==44
        cc[i]=32
    end
end

dd=cc.pack("C*")
print(dd)

Submission status: Runtime Error

Solution code:
k,s=map(int,input().split())
cnt=0
for i in range(k+1):
    for h in range(k+1):
        for j in range(k+1):
            if i+h+j==s:
                cnt+=1
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
k,s=map(int,input().split())
c=0
for i in range(k+1):
    for j in range(k+1):
        if s>=i+j and s-(i+j)<=k:
            c+=1
print(c)

Submission status: Runtime Error

Solution code:
abcde,fghihgf,edcba

Submission status: Runtime Error

Solution code:
# 文字列の入力
s = raw_input()
dst = s.replace(',', ' ')
# 出力
print(dst)