Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
W,H,x,y,r = map(int,input().split())

if W > r + x and H > r + y and x => r and y => r  :
    print('Yes')
else:
    print('No')


Fixed submission:
W,H,x,y,r = map(int,input().split())

if x-r < 0:
    print("No")
elif x + r > W:
    print("No")
elif y-r < 0:
    print ("No")
elif y+r > H:
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
W,H,x,y,r = map(int,input().split())

if x-r < 0:
    print "No"
elif x + r > W:
    print "No"
elif y-r < 0:
    print "No"
elif y+r > H:
    print "No"
else:
    print "Yes"


Fixed submission:
W,H,x,y,r = map(int,input().split())

if x-r < 0:
    print("No")
elif x + r > W:
    print("No")
elif y-r < 0:
    print ("No")
elif y+r > H:
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
W,H,x,y,r = map(int,input().split())

if x-r < 0:
    print "No"
elif x + r > W:
    print "No"
elif y-r < 0:
    print "No"
elif y+r > H:
    print "No"
else:
    print "Yes"


Fixed submission:
W,H,x,y,r = map(int,input().split())

if x-r < 0:
    print("No")
elif x + r > W:
    print("No")
elif y-r < 0:
    print ("No")
elif y+r > H:
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
W,H,x,y,r = map(int,input().split())

if x-r < 0:
    print "No"
elif x + r > W:
    print "No"
elif y-r < 0:
    print "No"
elif y+r > H:
    print "No"
else:
    print "Yes"


Fixed submission:
W,H,x,y,r = map(int,input().split())

if x-r < 0:
    print("No")
elif x + r > W:
    print("No")
elif y-r < 0:
    print ("No")
elif y+r > H:
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):

num = 1

While = True:
    x = int(input())
    if x == 0: break
    print ("Case {0}: {1}".format(num,x))
    num += 1


Fixed submission:

num = 1

while True:
    x = int(input())
    if x == 0: break
    print ("Case {0}: {1}".format(num,x))
    num += 1

Buggy python submission (verdict: Runtime Error):

num = 1

While True:
    x = int(input())
    if x == 0: break
    print ("Case {0}: {1}".format(num,x))
    num += 1


Fixed submission:

num = 1

while True:
    x = int(input())
    if x == 0: break
    print ("Case {0}: {1}".format(num,x))
    num += 1
Buggy python submission (verdict: Runtime Error):
3 4
5 6
3 3
0 0


Fixed submission:
while True:
    H,W = map(int,input().split())
    if H==W==0:
        break
    print("#"*W)
    for i in range(0,H-2):
        print("#"+"."*(W-2)+"#")
    print("#"*W)
    print()
Buggy python submission (verdict: Runtime Error):
num + input()
jun = input().split()
gyaku = reversed(jun)
print(*gyaku)


Fixed submission:
num = input()
jun = list(map(int,input().split()))
gyaku = reversed(jun)
print(*gyaku)

Buggy python submission (verdict: Runtime Error):
num + input()
jun = input().split()
gyaku = reversed(jun)
print(*gyaku)


Fixed submission:
num = input()
jun = list(map(int,input().split()))
gyaku = reversed(jun)
print(*gyaku)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
s = list(map(int, input().split()))
Q = int(input())
t = list(map(int, input().split()))
count = 0


def b_search(x, y):
    a = 0
    b = len(x)
    if y > x[b-1] or y < x[a]:
        return 0
    while b - a >= 1:
        c = (a + b) // 2
        if x[c] == y:
            return 1
        elif y < x[c]:
            b = c
        else:
            a = c
    return 0


for i in range(len(t)):
    count += b_search(s, t[i])

print(count)



Fixed submission:
N = int(input())
s = list(map(int, input().split()))
Q = int(input())
t = list(map(int, input().split()))
count = 0


def b_search(x, y):
    a = 0
    b = len(x)
    if y > x[b-1] or y < x[a]:
        return 0
    while b - a > 1:
        c = (a + b) // 2
        if x[c] == y:
            return 1
        elif y < x[c]:
            b = c
        else:
            a = c
    return 0


for i in range(len(t)):
    count += b_search(s, t[i])

print(count)
Buggy python submission (verdict: Time Limit Exceeded):
def prime_numbers(numbers):
    total = 0
    for n in numbers:
        for i in range(2, n):
            if n % i == 0:
                break
        else:
            total += 1
    return total

if __name__ == '__main__':
    n = []
    for _ in range(int(input())):
        n.append(int(input()))
    print(prime_numbers(n))



Fixed submission:
import math

def prime_numbers(numbers):
    return list(map(is_prime, numbers)).count(True)


def is_prime(n):
    if (n == 2):
        return True
    elif (n % 2 == 0):
        return False
    else:
        i = 3
        while i <= math.sqrt(n):
            if n % i == 0:
                return False
            i += 2

    return True

if __name__ == '__main__':
    n = int(input())
    numbers = []
    for i in range(0, n):
        numbers.append(int(input()))
    print(prime_numbers(numbers))

Buggy python submission (verdict: Time Limit Exceeded):
import math

def prime_numbers(numbers):
    return list(map(is_prime, numbers)).count(True)


def is_prime(n):
    if (n == 2):
        return True
    elif (n % 2 == 0):
        return False
    else:
        for i in range(3, int(n / 2), 2):
            if n % i == 0:
                return False

    return True

if __name__ == '__main__':
    n = int(input())
    numbers = []
    for i in range(0, n):
        numbers.append(int(input()))
    print(prime_numbers(numbers))



Fixed submission:
import math

def prime_numbers(numbers):
    return list(map(is_prime, numbers)).count(True)


def is_prime(n):
    if (n == 2):
        return True
    elif (n % 2 == 0):
        return False
    else:
        i = 3
        while i <= math.sqrt(n):
            if n % i == 0:
                return False
            i += 2

    return True

if __name__ == '__main__':
    n = int(input())
    numbers = []
    for i in range(0, n):
        numbers.append(int(input()))
    print(prime_numbers(numbers))
Buggy python submission (verdict: Time Limit Exceeded):
def maximum_profit(n):
    maxv = min(n) - max(n)
    for i in range(len(n)-1):
        m = max(n[i+1:])
        if maxv < m - n[i]:
            maxv = m - n[i]
    return maxv

if __name__ == '__main__':
    n = []
    for _ in range(int(input())):
        n.append(int(input()))
    print(maximum_profit(n))



Fixed submission:
def maximum_profit(n):
    maxv = min(n) - max(n)
    minv = n[0]
    for i in range(1, len(n)):
        maxv = n[i] - minv if maxv < n[i] - minv else maxv
        minv = n[i]        if minv > n[i]        else minv
    return maxv
if __name__ == '__main__':
    n = int(input())
    numbers = [int(input()) for i in range(0, n)]
    print(maximum_profit(numbers))

Buggy python submission (verdict: Time Limit Exceeded):
def maximum_profit(n):
    max_profit = min(n) - max(n)
    for i in range(1, len(n)):
        x = max(n[i:]) - n[i-1]
        if max_profit < x:
            max_profit = x
    return max_profit

if __name__ == '__main__':
    n = int(input())
    numbers = [int(input()) for i in range(0, n)]
    print(maximum_profit(numbers))



Fixed submission:
def maximum_profit(n):
    maxv = min(n) - max(n)
    minv = n[0]
    for i in range(1, len(n)):
        maxv = n[i] - minv if maxv < n[i] - minv else maxv
        minv = n[i]        if minv > n[i]        else minv
    return maxv
if __name__ == '__main__':
    n = int(input())
    numbers = [int(input()) for i in range(0, n)]
    print(maximum_profit(numbers))
Buggy python submission (verdict: Runtime Error):
import math

def distance(a, b):
    return float('{:.9}'.format(math.sqrt((b[0] - a[0])**2 + (b[1] - a[1])**2)))

if __name__ == '__main__':
    x1, y1, x2, y2 = map(int, input().split())
    print(distance((x1, y1), (x2, y2)))



Fixed submission:
import math

def distance(a, b):
    dx = abs(a[0]-b[0])
    dy = abs(a[1]-b[1])
    return math.sqrt(dx*dx + dy*dy)

if __name__ == '__main__':
    x1, y1, x2, y2 = map(float, input().split())
    print(distance((x1, y1), (x2, y2)))

Buggy python submission (verdict: Runtime Error):
import math

def distance(a, b):
    return float('{:.9}'.format(math.sqrt((b[0] - a[0])**2 + (b[1] - a[1])**2)))

if __name__ == '__main__':
    x1, y1, x2, y2 = map(int, input().split())
    print(distance((x1, y1), (x2, y2)))



Fixed submission:
import math

def distance(a, b):
    dx = abs(a[0]-b[0])
    dy = abs(a[1]-b[1])
    return math.sqrt(dx*dx + dy*dy)

if __name__ == '__main__':
    x1, y1, x2, y2 = map(float, input().split())
    print(distance((x1, y1), (x2, y2)))
Buggy python submission (verdict: Runtime Error):
import math

def triangle(a, b, deg):
    result = {}
    rad = math.radians(deg)    // 余弦定理
    c = math.sqrt(a*a+b*b-(2*a*b*math.cos(rad)))
    s = (a+b+c)/2
    result['area'] = math.sqrt(s*(s-a)*(s-b)*(s-c))
    result['perimeter'] = a+b+c
    result['height'] = result['area'] * 2 / a
    return result

if __name__ == '__main__':
    a, b, deg = map(int, input().split())
    triangle = triangle(a, b, deg)
    print(triangle['area'])
    print(triangle['perimeter'])
    print(triangle['height'])



Fixed submission:
import math

def triangle(a, b, deg):
    result = {}
    rad = math.radians(deg)
    c = math.sqrt(a*a+b*b-(2*a*b*math.cos(rad)))
    s = (a+b+c)/2
    result['area'] = math.sqrt(s*(s-a)*(s-b)*(s-c))
    result['perimeter'] = a+b+c
    result['height'] = result['area'] * 2 / a
    return result

if __name__ == '__main__':
    a, b, deg = map(int, input().split())
    triangle = triangle(a, b, deg)
    print(triangle['area'])
    print(triangle['perimeter'])
    print(triangle['height'])
Buggy python submission (verdict: Runtime Error):
from collections import deque

class Dice:
    def __init__(self, top, down, right, left, up, bottom):
        self.top = top
        self.bottom = bottom
        self.up = up
        self.down = down
        self.left = left
        self.right = right

    def roll(self, command):
        for c in list(command):
            if c == 'N':
                self.up, self.top, self.down, self.bottom = self.top, self.down, self.bottom, self.up
            elif c == 'S':
                self.up, self.top, self.down, self.bottom = self.bottom, self.up, self.top, self.down
            elif c == 'E':
                self.left, self.top, self.right, self.bottom = self.bottom, self.left, self.top, self.right
            elif c == 'W':
                self.left, self,top, self.right, self.bottom = self.top, self.right, self.bottom, self.left

    def pip(self):
        return self.top

if __name__ == '__main__':
    seq = list(map(int, input().split()))
    dice = Dice(*seq)
    dice.roll(input())
    print(dice.pip())



Fixed submission:
from collections import deque

class Dice:
    def __init__(self, top, down, right, left, up, bottom):
        self.top = top
        self.bottom = bottom
        self.up = up
        self.down = down
        self.left = left
        self.right = right

    def roll(self, command):
        for c in list(command):
            if c == 'N':
                self.up, self.top, self.down, self.bottom = self.top, self.down, self.bottom, self.up
            elif c == 'S':
                self.up, self.top, self.down, self.bottom = self.bottom, self.up, self.top, self.down
            elif c == 'E':
                self.left, self.top, self.right, self.bottom = self.bottom, self.left, self.top, self.right
            elif c == 'W':
                self.left, self.top, self.right, self.bottom = self.top, self.right, self.bottom, self.left

    def pip(self):
        return self.top

if __name__ == '__main__':
    seq = list(map(int, input().split()))
    dice = Dice(*seq)
    dice.roll(input())
    print(dice.pip())
Buggy python submission (verdict: Runtime Error):
print(input() ** 3)

Fixed submission:
print(int(input())**3)

Buggy python submission (verdict: Runtime Error):
print(input()**3)

Fixed submission:
print(int(input())**3)

Buggy python submission (verdict: Runtime Error):
x=input()
print(x**3)

Fixed submission:
print(int(input())**3)

Buggy python submission (verdict: Runtime Error):
def get_cubic(x):
    return x ** 3

if __name__ == '__main__':
    x = int(input())
    print(x_cubic(x))



Fixed submission:
print(int(input())**3)

Buggy python submission (verdict: Runtime Error):
def get_cubic(x):
    return x ** 3

if __name__ == '__main__':
    x = int(input())
    print(x_cubic(x))



Fixed submission:
print(int(input())**3)
Buggy python submission (verdict: Runtime Error):
h,m=divmod(int(input()),3600)
m,s=divmod(m,60)
print(h+':'+m+':'+s)

Fixed submission:
S = int(input())
print("{}:{}:{}".format(S//60//60, S//60%60,S%60))
Buggy python submission (verdict: Runtime Error):
def shuffle(str, m):
    return str[m:] + str[0:m]

if __name__ == '__main__':
    while True:
        str = input()
        if str == '-':
            break
        m = int(input())
        for _ in range(m):
            str = shuffle(str, int(input()))

        print(str)



Fixed submission:
def card_game(pairs):
    points = [0, 0]
    for pair in pairs:
        if (pair[0] > pair[1]):
            points[0] += 3
        elif (pair[0] < pair[1]):
            points[1] += 3
        else:
            points[0] += 1
            points[1] += 1

    return points

if __name__ == '__main__':
    n = int(input())
    pairs = []
    for _ in range(n):
        pairs.append(input().split())

    points = card_game(pairs)
    print(' '.join(map(str, points)))
Buggy python submission (verdict: Runtime Error):
def transformate(s, command):
    command, *op = command.split()

    op[0] = int(op[0])
    op[1] = int(op[1])
        
    if command == 'replace':
        return s[0:op[0]] + op[2] + s[op[1]+1:]
    elif command == 'reverse':
        return s[0:op[0]] + s[op[0]:op[1]+1][::-1] + s[op[1]+1:]
    elif command == 'print':
        print(output)
        return s

if __name__ == '__main__':
    s = input()
    for _ in range(int(input())):
        s = transformate(s, input())



Fixed submission:
def transformate(s, command):
    command, *op = command.split()

    op[0] = int(op[0])
    op[1] = int(op[1])

    if command == 'replace':
        return s[0:op[0]] + op[2] + s[op[1]+1:]
    elif command == 'reverse':
        return s[0:op[0]] + s[op[0]:op[1]+1][::-1] + s[op[1]+1:]
    elif command == 'print':
        print(s[op[0]:op[1]+1])
        return s

if __name__ == '__main__':
    s = input()
    for _ in range(int(input())):
        s = transformate(s, input())
Buggy python submission (verdict: Runtime Error):
def getCal(a,b):
    return a//b, a%b, float((a*100000/b)/100000)

a, b = map(int, input().split())
d, r, f = getCal(a,b)

print("{} {} {2: 5f}".format(d, r, f))

Fixed submission:
a, b = map(int, input().split())

print(a//b, a%b, '%.5f' % (a/b))

Buggy python submission (verdict: Runtime Error):
def getCal(a,b):
    return a//b, a%b, float(a/b)

a, b = map(int, input().split())
d, r, f = getCal(a,b)

print("{} {} {2: 5f}".format(d, r, f))

Fixed submission:
a, b = map(int, input().split())

print(a//b, a%b, '%.5f' % (a/b))
Buggy python submission (verdict: Runtime Error):
import math

PI = math.pi

r = input()

area = float(2 * PI + r)
circumference = float(PI * r * r)
print("{} {}".format(area, circumference))

Fixed submission:
import math

PI = math.pi

r = float(input())

area = float(PI * r * r)
circumference = float(2 * PI * r)
print("{} {}".format(area, circumference))
Buggy python submission (verdict: Time Limit Exceeded):
def bubble_sort(l):
    N = len(l)
    isChange = True
    while isChange:
        isChange = False
        for i in range(N-1):
            if(l[i] > l[i+1]):
                l[i], l[i+1] = l[i+1], l[i]
                isChange = True
    return l

N = int(input())
l = map(int, input().split())
l = list(l)
L = bubble_sort(l)
sum = 0
for k in L:
    sum += k

print("{} {} {}".format(L[0], L[-1], sum))

Fixed submission:
N = input()
l = map(int, input().split())
l = list(l)
print("{} {} {}".format(min(l), max(l), sum(l)))
Buggy python submission (verdict: Runtime Error):
while True:
    h, w = map(int, input().split())
    for i in range(h):
        print('#'*w)


Fixed submission:
while True:
    h, w = map(int, input().split())
    if h == w == 0:
        break
    for i in range(h):
        print('#'*w)
    print()
Buggy python submission (verdict: Runtime Error):
tramps = {
    "S": [0] * 13,
    "H": [0] * 13,
    "C": [0] * 13,
    "D": [0] * 13
}
# print(tramps)

# 持っているカード
n = int(input())

for i in range(n):
    kind, num = input().split()
    tramps[kind][num - 1] = 1

for i in ["S", "H", "C", "D"]:
    for j in range(13):
        tramp = tramps[i][j]
        if tramp == 0:
            print(tramps)



Fixed submission:
# 正解データ
tramps = {
    "S": [0] * 13,
    "H": [0] * 13,
    "C": [0] * 13,
    "D": [0] * 13
}
# print(tramps)

# 持っているカード
n = int(input())

for i in range(n):
    kind, num = input().split()
    tramps[kind][int(num) - 1] = 1

for i in ["S", "H", "C", "D"]:
    for j in range(13):
        tramp = tramps[i][j]
        if tramp == 0:
            print("{} {}".format(i, j+1))
Buggy python submission (verdict: Runtime Error):
def func(n,k):
    A = []
    ans = 0
    for i in range(n):
        A.append(int(input()))
    for i in range(k-1):
        SUM += A[i]
    for i in range(k,len(a)):
        ans = max(ans,SUM+a[i]-a[i-k])
    print(ans)

for i in range(100):
    n,k = [int(s) for s in input().split()]
    if n == 0 and k ==0:
        break
    else:
        func(n,k)


Fixed submission:
def func(n,k):
    SUM = 0
    ans = 0
    A = [int(input()) for _ in range(n)]
    for i in range(k):
        SUM += A[i]
    for i in range(k,len(A)):
        ans = max(ans,SUM+A[i]-A[i-k])
        SUM = SUM+A[i]-A[i-k]
    print(ans)

for _ in range(10):
    n,k = [int(s) for s in input().split()]
    if n == 0 and k ==0:
        break
    else:
        func(n,k)

Buggy python submission (verdict: Runtime Error):
def func(n,k):
    A = []
    ans = 0
    SUM = 0
    for i in range(n):
        A.append(int(input()))
    for i in range(k-1):
        SUM += A[i]
    for i in range(k,len(a)):
        ans = max(ans,SUM+a[i]-a[i-k])
    print(ans)

for i in range(100):
    n,k = [int(s) for s in input().split()]
    if n == 0 and k ==0:
        break
    else:
        func(n,k)


Fixed submission:
def func(n,k):
    SUM = 0
    ans = 0
    A = [int(input()) for _ in range(n)]
    for i in range(k):
        SUM += A[i]
    for i in range(k,len(A)):
        ans = max(ans,SUM+A[i]-A[i-k])
        SUM = SUM+A[i]-A[i-k]
    print(ans)

for _ in range(10):
    n,k = [int(s) for s in input().split()]
    if n == 0 and k ==0:
        break
    else:
        func(n,k)

Buggy python submission (verdict: Runtime Error):
def func(n,k):
    SUM = 0
    A = [int(input()) for _ in range(n)]
    for i in range(k-1):
        SUM += A[i]
    ans = SUM
    for i in range(k,len(A)):
        ans = max(ans,SUM+A[i]-A[i-k])
    print(ans)

for _ in range(10)
    n,k = [int(s) for s in input().split()]
    if n == 0 and k ==0:
        break
    else:
        func(n,k)


Fixed submission:
def func(n,k):
    SUM = 0
    ans = 0
    A = [int(input()) for _ in range(n)]
    for i in range(k):
        SUM += A[i]
    for i in range(k,len(A)):
        ans = max(ans,SUM+A[i]-A[i-k])
        SUM = SUM+A[i]-A[i-k]
    print(ans)

for _ in range(10):
    n,k = [int(s) for s in input().split()]
    if n == 0 and k ==0:
        break
    else:
        func(n,k)

Buggy python submission (verdict: Runtime Error):
def func(n,k):
    SUM = 0
    ans = 0
    A = [int(input()) for _ in range(n)]
    for i in range(k-1):
        SUM += A[i]
    for i in range(k,len(A)):
        ans = max(ans,SUM+A[i]-A[i-k])
        SUM = SUM+A[i]-A[i-k]
    print(ans)

for _ in range(10)
    n,k = [int(s) for s in input().split()]
    if n == 0 and k ==0:
        break
    else:
        func(n,k)


Fixed submission:
def func(n,k):
    SUM = 0
    ans = 0
    A = [int(input()) for _ in range(n)]
    for i in range(k):
        SUM += A[i]
    for i in range(k,len(A)):
        ans = max(ans,SUM+A[i]-A[i-k])
        SUM = SUM+A[i]-A[i-k]
    print(ans)

for _ in range(10):
    n,k = [int(s) for s in input().split()]
    if n == 0 and k ==0:
        break
    else:
        func(n,k)
Buggy python submission (verdict: Runtime Error):
print (x**3)

Fixed submission:
x = raw_input()
print(int(x)**3)

Buggy python submission (verdict: Runtime Error):
print (x**3)

Fixed submission:
x = raw_input()
print(int(x)**3)
Buggy python submission (verdict: Runtime Error):
S = input()
L = S.split()
a = L[0]
b = L[1]
if int(a) < int(b):
    print('a < b')
elif int(a) > int(b):
    print('a > b')
elif int(a) == int(b):
    print('a == b')

Fixed submission:
S = input()
L = S.split()
a = L[0]
a = int(a)
b = L[1]
b = int(b)
if a < b:
    print('a < b')
elif a > b:
    print('a > b')
elif a == b:
    print('a == b')

Buggy python submission (verdict: Runtime Error):
S = input()
L = S.split()
a = L[0]
a = int(a)
b = L[1]
b = int(b)
if a < b:
    print('a < b')
elif a > b:
    print('a > b')
elif a == b:
    print('a == b')

Fixed submission:
S = input()
L = S.split()
a = L[0]
a = int(a)
b = L[1]
b = int(b)
if a < b:
    print('a < b')
elif a > b:
    print('a > b')
elif a == b:
    print('a == b')
Buggy python submission (verdict: Runtime Error):
S = input()
L = S.split()

a = L[0]
b = L[1]
c = L[2]

a = int(a)
b = int(b)
c = int(c)
l = [a,b,c]
    
min_1 = min(a,b,c)
# print l.remove(min_1)
l.remove(min_1)

min_2 = min(l)

l.remove(min_2)

min_3 = l[0]
print min_1 , min_2, min_3

Fixed submission:
S =raw_input()
L = S.split()

a = L[0]
b = L[1]
c = L[2]

a = int(a)
b = int(b)
c = int(c)
l = [a,b,c]
    
min_1 = min(a,b,c)
# print l.remove(min_1)
l.remove(min_1)

min_2 = min(l)

l.remove(min_2)

min_3 = l[0]

min_1 = str(min_1)
min_2 = str(min_2)
min_3 = str(min_3)

print min_1+' '+min_2+' '+min_3

Buggy python submission (verdict: Runtime Error):
S = input()
L = S.split()

a = L[0]
b = L[1]
c = L[2]

a = int(a)
b = int(b)
c = int(c)
l = [a,b,c]
    
min_1 = min(a,b,c)
# print l.remove(min_1)
l.remove(min_1)

min_2 = min(l)

l.remove(min_2)

min_3 = l[0]
print min_1 , min_2, min_3

Fixed submission:
S =raw_input()
L = S.split()

a = L[0]
b = L[1]
c = L[2]

a = int(a)
b = int(b)
c = int(c)
l = [a,b,c]
    
min_1 = min(a,b,c)
# print l.remove(min_1)
l.remove(min_1)

min_2 = min(l)

l.remove(min_2)

min_3 = l[0]

min_1 = str(min_1)
min_2 = str(min_2)
min_3 = str(min_3)

print min_1+' '+min_2+' '+min_3

Buggy python submission (verdict: Runtime Error):
S = input()
L = S.split()

a = L[0]
b = L[1]
c = L[2]

a = int(a)
b = int(b)
c = int(c)
l = [a,b,c]
    
min_1 = min(a,b,c)
# print l.remove(min_1)
l.remove(min_1)

min_2 = min(l)

l.remove(min_2)

min_3 = l[0]

min_1 = str(min_1)
min_2 = str(min_2)
min_3 = str(min_3)

print min_1+' '+min_2+' '+min_3

Fixed submission:
S =raw_input()
L = S.split()

a = L[0]
b = L[1]
c = L[2]

a = int(a)
b = int(b)
c = int(c)
l = [a,b,c]
    
min_1 = min(a,b,c)
# print l.remove(min_1)
l.remove(min_1)

min_2 = min(l)

l.remove(min_2)

min_3 = l[0]

min_1 = str(min_1)
min_2 = str(min_2)
min_3 = str(min_3)

print min_1+' '+min_2+' '+min_3

Buggy python submission (verdict: Runtime Error):
S = input()
L = S.split()

a = L[0]
b = L[1]
c = L[2]

a = int(a)
b = int(b)
c = int(c)
l = [a,b,c]
    
min_1 = min(a,b,c)
# print l.remove(min_1)
l.remove(min_1)

min_2 = min(l)

l.remove(min_2)

min_3 = l[0]

min_1 = str(min_1)
min_2 = str(min_2)
min_3 = str(min_3)

print min_3+' '+min_2+' '+min_1

Fixed submission:
S =raw_input()
L = S.split()

a = L[0]
b = L[1]
c = L[2]

a = int(a)
b = int(b)
c = int(c)
l = [a,b,c]
    
min_1 = min(a,b,c)
# print l.remove(min_1)
l.remove(min_1)

min_2 = min(l)

l.remove(min_2)

min_3 = l[0]

min_1 = str(min_1)
min_2 = str(min_2)
min_3 = str(min_3)

print min_1+' '+min_2+' '+min_3