qyliang/CodeNanoFix huggingface dataset:
Buggy code:
s = input()
s.replace(',', ' ')
print(s)


Fixed code:
s = input()

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

Fixed code:
s=input()
ans=s.replace(","," ")
print(ans)
Buggy code:
s = input().split()
s_ = ''.join(s)
s_.replace(',', ' ')

Fixed code:
s = input().split()
s_ = ''.join(s)
print(s_.replace(',', ' '))
Buggy code:
a = input()
print(a.replace(',',' ')

Fixed code:
a = input().replace(',',' ')
print(a)
Buggy code:
s = " ".join(list(input().split(",")))

Fixed code:

s = " ".join(list(input().split(",")))
print(s)
Buggy code:
s = str(input())
print(s.replace(',',' ')

Fixed code:

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

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

Fixed code:
s=input().replace(","," ")
print(s)
Buggy code:
a = input().split(',')
' '.join(a)

Fixed code:
a = input().split(',')
print(' '.join(a))
Buggy code:
s=input()
s.replace(',',' ')
print(s)

Fixed code:
s=input()
a=s.replace(',',' ')
print(a)
Buggy code:
a = str(input())

a.replace(","," ")

print(a)

Fixed code:
a = str(input())

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

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

Fixed code:
s = input()
a = " ".join(s.split(","))
print(a)
Buggy code:
    string = input()

    ans = string.replace(',', ' ')
    print(ans)

Fixed code:
string = input()

ans = string.replace(',', ' ')
print(ans)
Buggy code:
print(input().replace(',',' ')

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

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

Fixed code:
s = input()
ans = s.replace(",", " ")
print(ans)
Buggy code:
s=input()
resutl=''
for i in s:
    if i==',':
        result+=' '
    else:
        result+=i
print(result)

Fixed code:
s=input()
result=''
for i in s:
    if i==',':
        result+=' '
    else:
        result+=i
print(result)
Buggy code:
a=input()
a.replace(","," ")
print(a)

Fixed code:
a = str(input())

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

Fixed code:
s = input()

print(s.replace(","," "))
Buggy code:
s = input()
for i in s:
  if i == ',':
    i = ' ':
print(s)

Fixed code:
s = input()
for i in s:
  if i == ',':
    i = ' '
  print(i,end="")

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

Fixed code:

s = input()

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

Fixed code:
s = (input())

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


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


Fixed code:
s = input().split(',')
s = (' ').join(s)
print(s)
Buggy code:
s = input()
print(s.replace(',', ' '))
a = input()
print(a.replace(',' , ' ')

Fixed code:
s = input().replace(',', ' ')
print (s)
Buggy code:
s = input()
print(s, s.replace(",", " "))

Fixed code:
s = input()
t = s.replace(',', ' ')
print(t)
Buggy code:
a = str(input())
print a.replace(","," ")

Fixed code:
a = input()
a = a.replace(',', ' ')
print(a)
Buggy code:
for s in input().split():
  print(s,end=' ')

Fixed code:
for s in input().split(','):
  print(s,end=' ')
Buggy code:
s=input()
a=list(input.split(","))
print(*a)

Fixed code:

s=input()
a=list(s.split(","))
print(*a)
Buggy code:
import sys
input = sys.stdin.readline

print(input().split(','))

Fixed code:
import sys
input = sys.stdin.readline

print(' '.join(input().split(',')))
Buggy code:
num = [int(input()) for i in range(10)]
num.sort(reverse=True)
for i in range[0:3]:
    print(num[i])


Fixed code:
num = [int(input()) for i in range(10)]
num.sort(reverse=True)
for i in range(3):
    print(num[i])
Buggy code:
l = []
for i in range(10):
    l.append(int(input()))
l.sort()
for i in range(3):
    print(l[i])


Fixed code:
l = []
for i in range(10):
    l.append(int(input()))
l.sort()
for i in range(3):
    print(l[9-i])
Buggy code:
mh=[]

for i in range(1,11):
    mh.append(int(input()))

mh.sort(reverse=True)
print(mh[0:3])
 


Fixed code:
mh=[]

for i in range(1,11):
    mh.append(int(input()))

mh.sort(reverse=True)
print(mh[0])
print(mh[1])
print(mh[2])
Buggy code:
mountains = []

for i in range(10):
    m = int(input())
    mountains.append(m)

mountains.sort()

for i in range(3):
    print(mountains[i])


Fixed code:
mountains = []

for i in range(10):
    m = int(input())
    mountains.append(m)

mountains.sort(reverse=True)

for i in range(3):
    print(mountains[i])
Buggy code:
#!/usr/bin/env python3
#coding: utf-8

# Volume0 - 0001 (http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0001)

li = []
for x in range(3):
    s = input()
    s = int(s)
    li.append(s)

li.sort()
li.reverse()

for y in range(3):
    print(li[y])

Fixed code:
#!/usr/bin/env python3
#coding: utf-8

# Volume0 - 0001 (http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0001)

li = []
for x in range(10):
    s = input()
    s = int(s)
    li.append(s)

li.sort()
li.reverse()

for y in range(3):
    print(li[y])
Buggy code:
j = []
for i in range(10) :
    j.append(int(input()))
j.reverse()
for k in range(3) :
    print(j[k])

Fixed code:
j = []
for i in range(10) :
    j.append(int(input()))
j.sort(reverse = True)
for k in range(3) :
    print(j[k])
Buggy code:
if __name__ == "__main__":
    a = []
    for i in range(0,10):
        val = input()
        a.append(int(val))

    a.sort()
    a.reverse()
    for i in range(0,3):
        print(a[i])

    print(a)

Fixed code:
if __name__ == "__main__":
    a = []
    for i in range(0,10):
        val = input()
        a.append(int(val))

    a.sort()
    a.reverse()
    for i in range(0,3):
        print(a[i])
Buggy code:
# -*- coding:utf-8 -*-

def main():
    List=[]

    for i in range(10):
        a=input()
        List.append(a)

    List.sort(reverse=True)
    print(List[0])
    print(List[1])
    print(List[2])
        
 
if __name__ == '__main__':
    main()

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

def main():
    List=[]

    for i in range(10):
        a=int(input())
        List.append(a)

    List.sort(reverse=True)
    print(List[0])
    print(List[1])
    print(List[2])
        
 
if __name__ == '__main__':
    main()
Buggy code:
s=[int(input(x)) for x in range(10)]
print(sorted(s)[-1])
print(sorted(s)[-2])
print(sorted(s)[-3])

Fixed code:
s=[int(input()) for x in range(10)]
print(sorted(s)[-1])
print(sorted(s)[-2])
print(sorted(s)[-3])
Buggy code:
def main():
    a = []
    for i in range(10):
        a.append(int(input()))

    a.sort()
    a.reverse()

    for i in range(3):
        print(i)

if __name__ == '__main__':
    main()

Fixed code:
def main():
    a = []
    for i in range(10):
        a.append(int(input()))

    a.sort()
    a.reverse()

    for i in range(3):
        print(a[i])

if __name__ == '__main__':
    main()
Buggy code:
hight = []

for i in range(10):
    hight.append(int(input()))

hight.sort()
print(hight[0])
print(hight[1])
print(hight[2])

Fixed code:
hight = []

for i in range(10):
    hight.append(int(input()))

hight.sort(reverse=True)
print(hight[0])
print(hight[1])
print(hight[2])
Buggy code:
l = []

for i in range(10):
    l.append(int(input()))

l.sort()

for i in range(3):
    print(l[-1 * [i+1]])

Fixed code:
l = []

for i in range(10):
    l.append(int(input()))

l.sort()

for i in range(3):
    print(l[-1 * (i+1)])
Buggy code:
# -*- coding:utf-8 -*-

first = 0
second = 0
third = 0
i = 0

for i in range(0,9):
    line = int(input())
    
    if first < int(line):
        third = second
        second = first
        first = int(line)
    elif second < int(line):
        third = second
        second = int(line)
    elif third < int(line):
        third = int(line)


print(first)
print(second)
print(third)

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

first = 0
second = 0
third = 0
i = 0

for i in range(0,10):
    line = int(input())
    
    if first < int(line):
        third = second
        second = first
        first = int(line)
    elif second < int(line):
        third = second
        second = int(line)
    elif third < int(line):
        third = int(line)
print(first)
print(second)
print(third)
Buggy code:
n = 0
list = []
while n < 10:
    x = input()
    list.append(x)
    n += 1

list.sort()
print(list[9])
print(list[8])
print(list[7])

Fixed code:
n = 0
list = []
while n < 10:
    x = int(input())
    list.append(x)
    n += 1

list.sort()
print(list[9])
print(list[8])
print(list[7])
Buggy code:
import sys

a = []
for line in sys.stdin:
    a.append(int(line))

a.reverse()
print(a[0])
print(a[1])
print(a[2])

Fixed code:
import sys

a = []
for line in sys.stdin:
    a.append(int(line))
a.sort()
a.reverse()
print(a[0])
print(a[1])
print(a[2])
Buggy code:
lis=[]
for i in range(10):
  lis.append(input())
 
for i in sorted(lis,reverse=True)[:3]:
  print(i)

Fixed code:
lis=[]
for i in range(10):
  lis.append(int(input()))
 
for i in sorted(lis,reverse=True)[:3]:
  print(i)
Buggy code:
ans=[]
for i in range (0,10):
    ans.append(input())
ans.sort(reverse=True)
for i in range (0,3):
    print(ans[i])

Fixed code:
ans=[]
for i in range (0,10):
    ans.append(int(input()))
ans.sort(reverse=True)
for i in range (0,3):
    print(ans[i])
Buggy code:
a = [int(input()) for i in range(10)]

a.reverse()
for i in range(3): 
    print(a[i])


Fixed code:
a = sorted([int(input()) for i in range(10)])
a.reverse()
for i in range(3):
	print(a[i])
Buggy code:
# -*- coding: utf-8 -*-

import sys

def top_k_sort(data, k=3, reverse=True):
    data.sort(reverse=True)
    return data[:k]

def main():
    data = []
    for line in sys.stdin:
        data.append(int(line))

    data = [int(v) for v in argv[1:]]
    for h in top_k_sort(data):
        print(h)

if __name__ == '__main__':
    main()

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

import sys

def top_k_sort(data, k=3, reverse=True):
    data.sort(reverse=True)
    return data[:k]

def main():
    data = []
    for line in sys.stdin:
        data.append(int(line))

    for h in top_k_sort(data):
        print(h)

if __name__ == '__main__':
    main()
Buggy code:
height_list = [int(input()) for i in range(10)]
for i in range(1,4): print sorted(height_list)[-i]

Fixed code:
height_list = [int(input()) for i in range(10)]
for i in range(1,4): print(sorted(height_list)[-i])
Buggy code:
[print(i) for i, in sorted([i for i in input() for _ in range(10)], reverse=True)[0:3]]

Fixed code:
[print(i) for i in sorted([int(input()) for _ in range(10)], reverse=True)[0:3]]
Buggy code:
heights = list()
for i in range(10):
    heights.append(int(input()))
for height in reversed(sorted(heights))[:3]:
    print(height)

Fixed code:
heights = list()
for i in range(10):
    heights.append(int(input()))
for height in list(reversed(sorted(heights)))[:3]:
    print(height)
Buggy code:
#! /usr/bin/env python
# -*- coding: utf-8 -*-

def main():
	mountains = []
	for i in range(3):
		mountains.append(input())
	
	mountains = sorted(mountains, reverse = True)

	for i in range(3):
		print(mountains[i])


if __name__ == '__main__':
    main()

Fixed code:
#! /usr/bin/env python
# -*- coding: utf-8 -*-

def main():
	mountains = []
	for i in range(10):
		mountains.append(int(input()))
	
	mountains = sorted(mountains, reverse = True)

	for i in range(3):
		print(mountains[i])


if __name__ == '__main__':
    main()
Buggy code:
m = []
for i in range(0, 10):
    m.append(input())
m.sort(reverse=True)
for i in range(0, 3):
    print(m[i])

Fixed code:
m = []
for i in range(0, 10):
    m.append(int(input()))
m.sort(reverse=True)
for i in range(0, 3):
    print(m[i])
Buggy code:
heights = []
for i in range(10):
    heights.append(int(input()))

for i in range(10):
    for j in range(i,10):
        if (heights[j] > heights[i]):
            w = heights[i]
            heights[i] = heights[j]
            heights[j] = w

print(heights[0:3])

Fixed code:
heights = []
for i in range(10):
    heights.append(int(input()))

for i in range(10):
    for j in range(i,10):
        if (heights[j] > heights[i]):
            w = heights[i]
            heights[i] = heights[j]
            heights[j] = w

for i in range(3):
    print(heights[i])
Buggy code:
def quicksort(array):
    if len(array) < 2:
        return array
    else:
        pivot = array[0]
        less = [i for i in array[1:] if i <= pivot]

        greater = [i for i in array[1:] if i > pivot]

        return quicksort(less) + [pivot] + quicksort(greater)


array = []
for _ in range(10):
    array.append(int(input('input integer')))

sorted_array = quicksort(array)
for i in range(3):
    print(sorted_array[9-i])

Fixed code:
def quicksort(array):
    if len(array) < 2:
        return array
    else:
        pivot = array[0]
        less = [i for i in array[1:] if i <= pivot]

        greater = [i for i in array[1:] if i > pivot]

        return quicksort(less) + [pivot] + quicksort(greater)


array = []
for _ in range(10):
    array.append(int(input()))

sorted_array = quicksort(array)
for i in range(3):
    print(sorted_array[9-i])
Buggy code:
a = []
for i in range(10):
    a.append(input())
a.sort()
a.reverse()

print a[:3]

Fixed code:
arr = []
for i in range (10):
    arr.append(int(input()))
arr.sort()
arr.reverse()
for a in range (3):
    print(arr[a])
Buggy code:
mt = list()
n = 10

for i in range(n):
    mt.append(int(input()))
mt.sort(reverse=True)
print(mt[0:3])

Fixed code:
mt = list()
n = 10

for i in range(n):
    mt.append(int(input()))
mt.sort(reverse=True)
for j in range(3):
    print(mt[j])
Buggy code:
def main():
    l = []
    for _ in range(10):
        l.append(input())
    l = sorted(l, reverse=True)
    for i in range(3):
        print(l[i])
    return None

if __name__ == '__main__':
    main()

Fixed code:
def main():
    l = []
    for _ in range(10):
        l.append(int(input()))
    l = sorted(l, reverse=True)
    for i in range(3):
        print(l[i])
    return None

if __name__ == '__main__':
    main()
Buggy code:
list=list()
for i in range(10):
    t=input()
    list.append(int(t))
list.sort()
for i in range(3):
    print(list[i])

Fixed code:
list=list()
for i in range(10):
    t=input()
    list.append(int(t))
list.sort(reverse=True)
for i in range(3):
    print(list[i])
Buggy code:
heightOfMountains = []
for i in range(1, 11):
	heightOfMountains.append(int(input()))
heightOfMountains.sort()
for i in range(1, 4):
	print(heightOfMountains[-j])

Fixed code:
heightOfMountains = []
for i in range(1, 11):
	heightOfMountains.append(int(input()))
heightOfMountains.sort()
for i in range(1, 4):
	print(heightOfMountains[-i])
Buggy code:
mountain=[]
for s in range(0,10):
    mountain.append(int(input()))
mountain.sort(reverse=true)
for s in range(0,3):
 print(mountain[s])

Fixed code:
mountain=[]
for s in range(0,10):
    mountain.append(int(input()))
mountain.sort(reverse=True)
for s in range(0,3):
 print(mountain[s])
Buggy code:
m_h=[int(input(I) for i in range(10)]

m_h.sort(reverse=True)

print(m_h[0])
print(m_h[1])
print(m_h[2])

Fixed code:
m_h=[int(input()) for i in range(10)]

m_h.sort(reverse=True)

print(m_h[0])
print(m_h[1])
print(m_h[2])
Buggy code:
l = [a,b,c,d,e,f,g,h,i,j]
a,b,c,d,e,f,g,h,i,j = int(input())
l.sort()
print(l[-1])
print(l[-2])
print(l[-3])

Fixed code:
l = []
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
f = int(input())
g = int(input())
h = int(input())
i = int(input())
j = int(input())

l.append(a)
l.append(b)
l.append(c)
l.append(d)
l.append(e)
l.append(f)
l.append(g)
l.append(h)
l.append(i)
l.append(j)

l.sort()
print(l[-1])
print(l[-2])
print(l[-3])
Buggy code:
ls = []
for i in range(0,10):
    ls.append(int(input()))
ls.sort()
print(ls[7])
print(ls[8])
print(ls[9])

Fixed code:
ls = []
for i in range(0,10):
    ls.append(int(input()))
ls.sort()
print(ls[9])
print(ls[8])
print(ls[7])
Buggy code:

mountain = []

for _ in range(10):
	mountain.append(int(input()))
	
mountain.sort()
mountain.reverse()

print(mountain[0], mountain[1], mountain[2])

Fixed code:

mountain = []

for _ in range(10):
	mountain.append(int(input()))
	
mountain.sort()
mountain.reverse()

print(mountain[0])
print(mountain[1])
print(mountain[2])
Buggy code:
# coding: utf-8
# Here your code !

import sys

n = [int(input()) for i in range (1,11)] 
#t = [int(input()) for i in range(n)] 
n.sort()
n.reverse()

for j in range (1,4):
    print(n[j])

Fixed code:
# coding: utf-8
# Here your code !

import sys

n = [int(input()) for i in range (1,11)] 
#t = [int(input()) for i in range(n)] 
n.sort()
n.reverse()

for j in range (0,3):
    print(n[j])
Buggy code:
if __name__=="__main__":
    dataset = []
    for i in range(10):
        a = int(input())
        dataset.append(a)
    print(dataset)
    for j in range(3):
        print(max(dataset))
        dataset.remove(max(dataset))

Fixed code:
if __name__=="__main__":
    dataset = []
    for i in range(10):
        a = int(input())
        dataset.append(a)
    for j in range(3):
        print(max(dataset))
        dataset.remove(max(dataset))
Buggy code:
from sys import stdin

ns = []
for n in stdin:
  ns.append(n)
ns.sort(reverse = True)
for i in range(3):
  print(ns[i])

Fixed code:
from sys import stdin
ns = [int(n) for n in stdin]
ns.sort(reverse = True)
for i in range(3):
  print(ns[i])
Buggy code:
from sys import stdin
map(print,sorted([int(l) for l in stdin],reverse=True)[0:3])

Fixed code:
from sys import stdin

for x in sorted([int(l) for l in stdin],reverse=True)[0:3]:
  print(x)
Buggy code:
mountains_high=[]
for i in range(10):
    mountains_high.append(int(input()))

mountains_high_copy=mountains_high.copy()
for i in range(9):
    for j in range(9):
        if mountains_high_copy[j]>mountains_high_copy[j+1]:
            num=mountains_high_copy[j]
            mountains_high_copy[j]=mountains_high_copy[j+1]
            mountains_high_copy[j+1]=num

for i in range(3):
    print(mountains_high_copy[9-i

Fixed code:
mountains_high=[]
for i in range(10):
    mountains_high.append(int(input()))

mountains_high_copy=mountains_high.copy()
for i in range(9):
    for j in range(9):
        if mountains_high_copy[j]>mountains_high_copy[j+1]:
            num=mountains_high_copy[j]
            mountains_high_copy[j]=mountains_high_copy[j+1]
            mountains_high_copy[j+1]=num

for i in range(3):
    print(mountains_high_copy[9-i])
Buggy code:
l = []
for i in range(10):
    inp = input()
    l.append(int(inp.rstrip()))
l.sort().reverse()
for i in range(3):
    print(l[i])

Fixed code:
l = []
for i in range(10):
    inp = input()
    l.append(int(inp))
l.sort()
l.reverse()
for i in range(3):
    print(l[i])
Buggy code:
def main():

    mountains_list = [int(input()) for n in range(10)]
    print(list(reversed(sorted(mountains_list)))[:3])
    
main()

Fixed code:
def main():

    mountains_list = [int(input()) for n in range(10)]
    for i in range(3):
        print(list(reversed(sorted(mountains_list)))[i])
    
main()
Buggy code:
# -*- coding: utf-8 -*-

#a = [input() for i in range(N)]
#print a # [a1, a2, a3, ..., aN]

import sys

a = []
for line in sys.stdin:
    a.append(int(line))
#print a # [a1, a2, a3, ...]
sorted(a, reverse=True)
print(a[0])
print(a[1])
print(a[2])

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

#a = [input() for i in range(N)]
#print a # [a1, a2, a3, ..., aN]

import sys

a = []
for line in sys.stdin:
    a.append(int(line))
#print a # [a1, a2, a3, ...]
a.sort(reverse=True)
print(a[0])
print(a[1])
print(a[2])
Buggy code:
N = 10
mnts = []

for i in range(N):
    mnts.append(int(input()))

mnts.sort(reverse=True)
print(mnts)

for mnt in mnts[:3]:
    print(mnt)



Fixed code:
N = 10
mnts = []

for i in range(N):
    mnts.append(int(input()))

mnts.sort(reverse=True)

for mnt in mnts[:3]:
    print(mnt)
Buggy code:
num = 10
top = 3
mountains = [input() for i in range(num)]
mountains = sorted(mountains, reverse=True)
for i in range(top):
    print(mountains[i])


Fixed code:
num = 10
top = 3
mountains = [int(input()) for i in range(num)]
mountains = sorted(mountains, reverse=True)
for i in range(top):
    print(mountains[i])
Buggy code:
data = []
for i in range(0,10):
    data.append(input())

print()

data.sort()
data.reverse()
for i in range(3):
    print(data[i])



Fixed code:
data = []
for i in range(0,10):
    data.append(int(input()))


data.sort()
data.reverse()

for i in range(0,3):
    print(data[i])
Buggy code:
hills = [input() for _ in range(10)]
hills = list(map(int, hills))
hills.sort

for i in range(3):
    print(hills.pop())



Fixed code:
hills = [input() for _ in range(10)]
hills = list(map(int, hills))
hills.sort()

for i in range(3):
    print(hills.pop())
Buggy code:
m = [int(input()) for _ in range(10)]
m.sort()
[print(m[-i] for i in range(1, 4))]


Fixed code:
m = [int(input()) for _ in range(10)]
m.sort()
[print(m[-i]) for i in range(1, 4)]
Buggy code:
def main():
    a=[]
    for i in range(10):
        a.append(int(input()))
    a.sort()
    for j in range(-1, -4, -1):
        print(a[j])


Fixed code:
a=[]
for i in range(10):
    a.append(int(input()))
a.sort()
for j in range(-1, -4, -1):
    print(a[j])
Buggy code:
first = 0;
second = 0;
third = 0;
for var in range(0,10):
	N = input()
	if (N>first):
		third = second
		second = first
		first = N
	elif (N>second):
		third = second
		second = N
	elif (N>third):
		third = N
print (first)
print (second)
print (third)


Fixed code:
first = 0;
second = 0;
third = 0;
for var in range(0,10):
	N = int(input())
	if (N>first):
		third = second
		second = first
		first = N
	elif (N>second):
		third = second
		second = N
	elif (N>third):
		third = N
print (first)
print (second)
print (third)
Buggy code:
from sys import stdin

x = [int(input()) for i range(10)]

x.sort(reverse=True)

for i in x[:3]: print(i)

Fixed code:
from sys import stdin

x = [int(input()) for i in range(10)]

x.sort(reverse=True)

for i in x[:3]: print(i)
Buggy code:
a = []
for i in range(10):
    n = int(input())
    a.append(n)

a.sort()

for i in range(3):
    print(a[i])


Fixed code:
a=[]
for i in range(10):
 a.append(int(input()))
 a.sort()
 a.reverse()
for i in range(3):
 print(a[i])
Buggy code:
lst=[]
for n in range(10):
    lst.append(int(input())
res=sorted(lst, reverse=True)
for i in range(3):
    print(res[i])

Fixed code:
lst=[]
for i in range (10):
    n=int(input())
    lst.append(n)
ld = sorted(lst, reverse=True)
for n in ld[:3]:
    print(n)
Buggy code:
a=[]
for i in range(10):
    tmp = input()
    a.append(tmp)
b=sorted(a, reverse=True)
print(b[0])
print(b[1])
print(b[2])

Fixed code:
a=[]
for i in range(10):
  a.append(int(input()))
b=sorted(a,reverse=True)
print(b[0])
print(b[1])
print(b[2])
Buggy code:
a = []
for i in range(10):
    a.append(input())
a.sort()
a.reverse()
print(a[0])
print(a[1])
print(a[2])

Fixed code:
a=[]
for i in range(10):
    a.append(int(input()))
a.sort()
a.reverse()
print(a[0])
print(a[1])
print(a[2])
Buggy code:
l=[]
for i in range(10):
	l.append(int(input()))
l.sort().reverse()
print(l[0])
print(l[1])
print(l[2])

Fixed code:
l = []
for i in range(10):
    n = int(input())
    l.append(n)
    l.sort(reverse=True)
print(l[0])
print(l[1])
print(l[2])
Buggy code:
l=[]
for i in range(10):
	l.append(int(input()))
l.sort().reversed()
print(l[0])
print(l[1])
print(l[2])

Fixed code:
l=[]
for i in range(10):
    l.append(int(input()))
l.sort()
l.reverse()
print(l[0])
print(l[1])
print(l[2])
Buggy code:
l = []
for i in range(10):
    inp = input()
    l.append(int(inp))
l.sort().reverse()
for i in range(3):
    print(l[i])

Fixed code:
l = []
for i in range(10):
    l.append(int(input()))
l.sort(reverse=True)
for i in range(3):
    print(l[i])
Buggy code:
mountain=[]
for i in range(10):
 mountain[i]=int(input())
mountain.sort()
mountain.reverse()
for i in range(3):
 print(mountain[i])
 

Fixed code:
mountain = []
for i in range(10):
    mountain.append(int(input()))
mountain.sort()
mountain.reverse()
for i in range(3):
    print(mountain[i])
Buggy code:
s=[]
for i in range(10):
    s.append(int(input()))
s.sort()
for i in range(3):
    print(s[i])

Fixed code:
s = []
for i in range(10):
    s.append(int(input()))

s.sort(reverse=True)
for i in range(3):
    print(s[i])