Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = list(map(int,input().split()))

a = 0
for i in range(len(s)):
    if s.count(s[i]) > 1:
        a = 1
        break

if a == 0:
    print("YES")
else:
    print("NO")

Fixed submission:
n = int(input())
s = list(map(int,input().split()))
 
def count(x):
    if len(s) != len(set(x)):
        return "NO"
    else:
        return "YES"
print(count(s))
Buggy python submission (verdict: Runtime Error):
M,N = list(map(int,input().split()))
s = list(map(int,input().split()))
s1 = sorted(s)

if M <= s1[-1] + s1[-2]:
    print("Yes")
else:
    print("No")

Fixed submission:
M,N = list(map(int,input().split()))
s = list(map(int,input().split()))
 
if M <= sum(s):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
s = [0]*N
t = [0]*N
for i in range(N):
    s[i],t[i] = input().split()
s = [int(x) for x in s]
t = [int(x) for x in t]
def sel(a,b):
    u = []
    c = 0
    for i in range(len(a)-3):
        if abs(a[i+1] - a[i]) < b[i+1] + b[i]:
            c = c + 1
            a.pop(i)
            b.pop(i)
            a1 = a
            b1 = b
            sel(a1,b1)
            c = 0
    if c == 0:
        u.append(len(a))
    return u
u1 = sorted(sel(s,t))
print(u1[-1])

Fixed submission:
N,K,S = map(int,input().split())
t = [999999999]*N
for i in range(K):
    t[i] = S
print(*t)
Buggy python submission (verdict: Runtime Error):
N,M = [int(x) for x in input().split()]
s = []
for i in range(M):
    array = list(map(str,input().split()))
    s.append(array)
a = 0
b = 0
for i in range(M):
    if s[i][0] == s[i+1][0]:
        if s[i][1] == "WA":
            b = b + 1
        else:
            a = a + 1
            break
    else:
        if s[i][1] == "AC":
            a = a + 1
        else:
            b = b + 1
print(str(a) + " " + str(b))

Fixed submission:
N,M = [int(x) for x in input().split()]
s = []
for i in range(M):
    array = list(map(str,input().split()))
    s.append(array)

answer = 0
penalty = 0

WA = [0 for i in range(N)]
#print(t)
for i in range(M):
    if WA[int(s[i][0])-1] != "AC":
        if s[i][1] == "WA":
            WA[int(s[i][0])-1] += 1
        else:
            penalty += WA[int(s[i][0])-1]
            answer += 1
            WA[int(s[i][0])-1] = "AC"
    #print(WA)
print(answer,penalty)
Buggy python submission (verdict: Runtime Error):
K,X = [map(int,input().split())]
if K*500>=X:
    print("Yes")
else:
    print("No")

Fixed submission:
K,X = map(int,input().split())
if K*500>=X:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
K,X = [map(int,input().split())]
if K*500>=X:
  print("Yes")
else:
  print("No")

Fixed submission:
K,X = map(int,input().split())
if K*500>=X:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
A＝int(input())
B = int(input())
print(6-A-B)

Fixed submission:
A = int(input())
B = int(input())
print(6-A-B)
Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
import fractions
def lcm(x,y):
    return (x,y)//fractions.gcd(x,y)
print(lcm(A,B))

Fixed submission:
A,B = map(int,input().split())
import fractions
def lcm(x,y):
    return (x*y)//fractions.gcd(x,y)
print(lcm(A,B))

Buggy python submission (verdict: Runtime Error):
A,B = map(int,input().split())
import fractions
def lcm(x,y):
    return(x,y)//fractions.gcd(A,B)
print(lcm(A,B))

Fixed submission:
A,B = map(int,input().split())
import fractions
def lcm(x,y):
    return (x*y)//fractions.gcd(x,y)
print(lcm(A,B))
Buggy python submission (verdict: Time Limit Exceeded):
n, k = list(map(int, input().split()))

next = n
while (next >= 0 or n <= next): 
  n = next 
  n = abs(n-k)
 
a, b = list(map(int, input().split()))

n = max(a, b)
k = min(a, b)
prev = k


while (k <= prev and k != 0):
    prev = k
    a = int(n/k)
    b = n % k
    n = max(a, b)
    k = min(a, b)
    # print(a, b, prev, n, k)

print(prev)

Fixed submission:
N, K = list(map(int, input().split()))
x = N % K
print(min(x, K-x))
Buggy python submission (verdict: Runtime Error):
k, n = map(int, input().split())
aa = map(int, input().split())

B = []

for i in range(1, n):
    B.append(aa[i]-aa[i-1])
    
B.append(k-sum(B))
print(k-max(B))

Fixed submission:
k, n = map(int, input().split())
aa = list(map(int, input().split()))

B = []

for i in range(1, n):
    B.append(aa[i] - aa[i - 1])

B.append(k - sum(B))
print(k - max(B))

Buggy python submission (verdict: Runtime Error):
k, n = map(int, input().split())
aa = map(int, input().split())

B = []
for i in range(1, n):
    B.append(a[i]-a[i-1])
    
B.append(k-sum(B))
print(k-max(B))

Fixed submission:
k, n = map(int, input().split())
aa = list(map(int, input().split()))

B = []

for i in range(1, n):
    B.append(aa[i] - aa[i - 1])

B.append(k - sum(B))
print(k - max(B))
Buggy python submission (verdict: Runtime Error):
n = int(input())
costs = map(int, input().split())
a, b = cost[0], cost[0] + abs(costs[1]-cost[0])
i = 2
while i < n:
  a, b = b, min(abs(cost[i] - cost[i-1]) + b, abs(cost[i] - cost[i-2]) + a)
  i += 1
print(b)

Fixed submission:
n = int(input())
costs = list(map(int, input().split()))
a, b = 0, abs(costs[1]-costs[0])
i = 2
while i < n:
	a, b = b, min(abs(costs[i] - costs[i-1]) + b, abs(costs[i] - costs[i-2]) + a)
	i += 1
print(b)
Buggy python submission (verdict: Runtime Error):
import copy
from scipy.special import comb
n = int(input())
#x, y, a, b, c = map(int, input().split())
#s= list(input())
a = list(map(int, input().split()))
an = [0] * n
for i in range(n):
    an[a[i]-1] += 1

ac2 = []
ac2_diff = []
for i in range(n):
    ac2.append(comb(an[i], 2, exact=True))
    ac2_diff.append(ac2[i]-comb(an[i]-1, 2, exact=True))
sum = sum(ac2)
for i in range(n):
    print(sum - ac2_diff[a[i]-1])

Fixed submission:
import copy
from scipy.misc import comb
n = int(input())
#x, y, a, b, c = map(int, input().split())
#s= list(input())
a = list(map(int, input().split()))
an = [0] * n
for i in range(n):
    an[a[i]-1] += 1

ac2 = []
ac2_diff = []
for i in range(n):
    ac2.append(comb(an[i], 2, exact=True))
    ac2_diff.append(ac2[i]-comb(an[i]-1, 2, exact=True))
sum = sum(ac2)
for i in range(n):
    print(sum - ac2_diff[a[i]-1])
Buggy python submission (verdict: Time Limit Exceeded):
import copy
import itertools

h, w, k = map(int, input().split())
#s= list(input())

s = []
min = 100000
for i in range(h):
    s.append( [int(s) for s in list(input())])

l = list(range(h-1))
for i in range(h):
    p = list(itertools.combinations(l, i))
    for j in p:
        tmp = list(j)
        tmps = []
        q = 0
        tmps.append([])
        for r in range(h):
            tmps[q].append(copy.copy(s[r]))
            if(q < len(tmp) and r==tmp[q]):
                tmps.append([])
                q += 1
        #print(tmps)
        count = i
        sums = [0] * len(tmps)
        precut = 1
        exitflg = 0
        for r in range(w):
            for q in range(len(tmps)):
                for t in tmps[q]:
                    sums[q] += t[r]
            cutflg = 0
            for q in range(len(tmps)):
                if sums[q] > k :
                    cutflg = 1
            if cutflg == 1:
                #print('cut')
                count += 1
                sums = [0] * len(tmps)
                for q in range(len(tmps)):
                    for t in tmps[q]:
                        sums[q] += t[r]
            for q in range(len(tmps)):
                if sums[q] > k :
                    exitflg = 1
                    #print('exit')
        #print(exitflg)
        if exitflg == 0:
            if min > count:
                min = count
print(min)

Fixed submission:
import copy
import itertools

h, w, k = map(int, input().split())
#s= list(input())

s = []
min = 100000
for i in range(h):
    s.append( [int(s) for s in list(input())])
    #s.append([1]*w)

dbg_cnt = 0
l = list(range(h-1))
for i in range(h):
    p = list(itertools.combinations(l, i))
    for j in p:
        tmp = list(j)
        tmps = []
        q = 0
        tmps.append([])
        #print(dbg_cnt)
        #dbg_cnt += 1
        for r in range(h):
            tmps[q].append(copy.copy(s[r]))
            if(q < len(tmp) and r==tmp[q]):
                tmps.append([])
                q += 1
        #print(tmps)
        count = i
        sums = [0] * len(tmps)
        precut = 1
        exitflg = 0
        for r in range(w): #550000
            for q in range(len(tmps)):
                for t in tmps[q]:
                    sums[q] += t[r] #5500000
            cutflg = 0
            for q in range(len(tmps)):
                if sums[q] > k : #5500000
                    cutflg = 1
            if cutflg == 1:
                #print('cut')
                count += 1
                sums = [0] * len(tmps)
                for q in range(len(tmps)):
                    for t in tmps[q]:
                        sums[q] += t[r] #5500000
            for q in range(len(tmps)): #5500000
                if sums[q] > k :
                    exitflg = 1
                    #print('exit')
        #print(exitflg)
        if exitflg == 0:
            if min > count:
                min = count
print(min)
Buggy python submission (verdict: Runtime Error):
import copy
import itertools

s = input()
q = int(input())
#s= list(input())

ct = 0
ls = []
rs = []
for i in range(q):
    qtmp = input().split()
    "qtmp = [2,1,'c']
    t = int(qtmp[0])
    if(t == 1):
        ct += 1
        ct = ct % 2
    else:
        f = int(qtmp[1])
        if(ct == f):
            rs.append( qtmp[2])
        else:
            ls.append( qtmp[2])
if(ct == 1):
    tmp = rs
    rs = ls
    ls = tmp
for i in range(len(ls)):
    print(ls[len(ls)-i-1], end='')
print(s, end='')
for i in range(len(rs)):
    print(rs[i], end='')
print("")

Fixed submission:
import copy
import itertools

s = input()
q = int(input())
#s= list(input())

ct = 0
ls = []
rs = []
for i in range(q):
    qtmp = input().split()
    #qtmp = [2,1,'c']
    t = int(qtmp[0])
    if(t == 1):
        ct += 1
        ct = ct % 2
    else:
        f = int(qtmp[1])
        if(ct+1 == f):
            ls.append( qtmp[2])
        else:
            rs.append( qtmp[2])
if(ct == 1):
    tmp = rs
    rs = ls
    ls = tmp
    s = s[::-1]
for i in range(len(ls)):
    print(ls[len(ls)-i-1], end='')
print(s, end='')
for i in range(len(rs)):
    print(rs[i], end='')
print("")
Buggy python submission (verdict: Runtime Error):
from itertools import permutations

n = int(input)
p = list(map(int, input().split()))
q = list(map(int, input().split()))

allp = p.copy()
allp.sort()
allperms = list(map(list, permutations(allp)))
print(abs(allperms.index(p) - allperms.index(q))) 

Fixed submission:
from itertools import permutations

n = int(input())
p = list(map(int, input().split()))
q = list(map(int, input().split()))

allp = p.copy()
allp.sort()
allperms = list(map(list, permutations(allp)))
print(abs(allperms.index(p) - allperms.index(q)))
Buggy python submission (verdict: Runtime Error):
a, b ,c = map(input().split(" "))
print(c+" "+a+" "+b)

Fixed submission:
input = input().split(" ")
print(input[2] + " " + input[0] + " " + input[1])
Buggy python submission (verdict: Runtime Error):
s = input()
if s[2] == s[3] AND s[4] == s[5];
	print("Yes")
else print("No");

Fixed submission:

s=input()
print("Yes" if s[2]==s[3] and s[4]==s[5] else "No")
Buggy python submission (verdict: Runtime Error):
S=input()
if s[0] == s[1] and s[1] == s[2]:
    print('No')
else:
    print('yes')

Fixed submission:
S = input()

if len(set(S)) == 1:
    print('No')
else:
    print('Yes')
Buggy python submission (verdict: Time Limit Exceeded):
n,b,r=map(int,input().split())
blue=True
c=0
while n>0:
    if blue:
        x=b if n>b else n
        c+=x
        n-=x
    else:
        n-=r if n>r else n
    blue=(not blue)
print(c)

Fixed submission:
n,b,r=map(int,input().split())
x=n%(b+r)
c=b*(n//(b+r))
c+=b if x>b else x
print(c)
Buggy python submission (verdict: Runtime Error):
s = str(input())
t = str(input())
print(t + s)

Fixed submission:
i = str(input()).split(" ")
print(i[1] + i[0])

Buggy python submission (verdict: Runtime Error):
st = str(input())
s, t = st.split('')
print t + s

Fixed submission:
i = str(input()).split(" ")
print(i[1] + i[0])
Buggy python submission (verdict: Runtime Error):
a = input().split(" ")
a[0] = int(a[0])
a[1] = int(a[1])
a[2] = int(a[2])
if a[0] > 0 and a[1] > 0:
  print("0 0")
else:
  if a[2] > a[0]:
    a[0] = 0
  a[2] = a[2] - a
  if a[2] > a[1]:
    a[1] = 0
  else: 
    a[1] = a[1] - a[2]
  print(str(a[0]) + " " + str(a[1]))

Fixed submission:
a,b,k = map(int, input().split())
x = 0 if k > a else a - k
y = b if (k - a) <= 0 else (0 if (k - a) > b else b - (k - a))
print("{} {}".format(x,y))

Buggy python submission (verdict: Runtime Error):
a = input().split(" ")
a[0] = int(a[0])
a[1] = int(a[1])
a[2] = int(a[2])
if a[0] > 0 and a[1] > 0:
  print("0 0")
  return
else:
  if a[2] > a[0]:
    a[0] = 0
  a[2] = a[2] - a
  if a[2] > a[1]:
    a[1] = 0
  else: 
    a[1] = a[1] - a[2]
print(str(a[0]) + " " + str(a[1]))

Fixed submission:
a,b,k = map(int, input().split())
x = 0 if k > a else a - k
y = b if (k - a) <= 0 else (0 if (k - a) > b else b - (k - a))
print("{} {}".format(x,y))

Buggy python submission (verdict: Runtime Error):
a = input().split(" ")
a[0] = int(a[0])
a[1] = int(a[1])
if a[0] > 0 and a[1] > 0:
  for i in range(0, int(a[2])):
    if a[0] > 0:
      a[0] -= 1
    else:
      if a[0] == 0 and a[1] == 0:
  	  	break
  	  else:
        a[1] -= 1
print(str(a[0]) + " " + str(a[1]))

Fixed submission:
a,b,k = map(int, input().split())
x = 0 if k > a else a - k
y = b if (k - a) <= 0 else (0 if (k - a) > b else b - (k - a))
print("{} {}".format(x,y))
Buggy python submission (verdict: Runtime Error):
i = input().split("\n")
print(6 - int(i[0]) - int(i[1]))

Fixed submission:
a = int(input())
b = int(input())
print(6 - a - b)
Buggy python submission (verdict: Runtime Error):
import math
a,b=map(int,input().split())
print(int((a*b) // math.gcd(a,b)))

Fixed submission:
from fractions import gcd
a,b=map(int,input().split())
print(int((a*b) // gcd(a,b)))

Buggy python submission (verdict: Runtime Error):
from math import gcd
a,b=map(int,input().split())
print((a*b) // gcd(a,b))

Fixed submission:
from fractions import gcd
a,b=map(int,input().split())
print(int((a*b) // gcd(a,b)))

Buggy python submission (verdict: Runtime Error):
from math import gcd
a,b=map(int,input().split())
print(a*b//gcd(a,b))

Fixed submission:
from fractions import gcd
a,b=map(int,input().split())
print(int((a*b) // gcd(a,b)))
Buggy python submission (verdict: Runtime Error):
s = sum(input().split())
print('bust' if s >= 22 else 'win') 

Fixed submission:
s = sum(int(x) for x in input().split())
print('bust' if s >= 22 else 'win')
Buggy python submission (verdict: Runtime Error):
n=int(input())
a,b,c=[list(map(int,input().split())) for _ in range(3)]
x=sum(b)
for i in range(n-1):
    if a[i]+1==a[i+1]:
        b+=c[a[i]-1]
print(x)

Fixed submission:
n=int(input())
a,b,c=[list(map(int,input().split())) for _ in range(3)]
x=sum(b)
for i in range(n-1):
    if a[i]+1==a[i+1]:
        x+=c[a[i]-1]
print(x)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
print((b-2)//(a-1)+1)

Fixed submission:
n=int(input())
print(1/sum([1/float(i) for i in input().split()]))
Buggy python submission (verdict: Runtime Error):
a,b,h=map(int,input().split())
print((((a+b)*h)//2)

Fixed submission:
a,b,h=[int(input()) for _ in range(3)]
print(((a+b)*h)//2)

Buggy python submission (verdict: Runtime Error):
a,b,h=map(int,input().split())
print(((a+b)*h)/2)

Fixed submission:
a,b,h=[int(input()) for _ in range(3)]
print(((a+b)*h)//2)
Buggy python submission (verdict: Runtime Error):
if __name__ == "__main__":
    x = int(input())
    m, n = map(int, input().split())
    if m * 500 >= n:
        print("Yes")
    else:
        print("No")


Fixed submission:
if __name__ == "__main__":
    m, n = map(int, input().split())
    if m * 500 >= n:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
if sum(a, b, c) >= 22:
  print("bust")
else:
  print("win")

Fixed submission:
a, b, c = map(int, input().split())
if a + b + c >= 22:
  print("bust")
else:
  print("win")
Buggy python submission (verdict: Runtime Error):
S = input()
T = input()
print(T + S)

Fixed submission:
inputStrings = input().split()
print(inputStrings[1] + inputStrings[0])
Buggy python submission (verdict: Time Limit Exceeded):
inputNums = input().split()
A = int(inputNums[0])
B = int(inputNums[1])
K = int(inputNums[2])
while(K > 0):
  if (A > 1):
    A-=1
  elif (B > 1):
    B-=1
print(str(A) + " " + str(B))

Fixed submission:
inputNums = input().split()
A = int(inputNums[0])
B = int(inputNums[1])
K = int(inputNums[2])
if K > A:
    K = K - A
    A = 0
else:
    A = A - K
    K = 0
if K > B:
    K = K - B
    B = 0
else:
    B = B - K
    K = 0
print(str(A) + " " + str(B))
Buggy python submission (verdict: Runtime Error):
inputNums = input().split()
A1 = inputNums[0]
A2 = inputNums[1]
A3 = inputNums[2]
if (A1 + A2 + A3 >= 22):
    print('bust')
else:
    print('win')

Fixed submission:
inputNums = input().split()
A1 = int(inputNums[0])
A2 = int(inputNums[1])
A3 = int(inputNums[2])
if (A1 + A2 + A3 >= 22):
    print('bust')
else:
    print('win')
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
slist = []
clist = []

def check(numlist, slist, clist):
    for i in range(m):
        if int(numlist[slist[i]]) != clist[i]:
            return False
    return True

for i in range(m):
    s,c = map(int, input().split())
    slist.append(s-1)
    clist.append(c)
flag = 0
# if m > n:
#     print(-1)
# else:
    for num in range(10**(n-1), 10**n):
        numstring = str(num)
        numlist = list(numstring)
        if check(numlist, slist, clist):
            print(num)
            flag = 1
            break
    if not flag:
        print(-1)



Fixed submission:
n, m = map(int, input().split())
slist = []
clist = []

def check(numlist, slist, clist):
    for i in range(m):
        if int(numlist[slist[i]]) != clist[i]:
            return False
    return True

for i in range(m):
    s,c = map(int, input().split())
    slist.append(s-1)
    clist.append(c)

start = 10**(n-1)
end = 10**n
if n == 1:
    start = 0
flag = 0
for num in range(start, end):
    numstring = str(num)
    numlist = list(numstring)
    if check(numlist, slist, clist):
        print(num)
        flag = 1
        break
if not flag:
    print(-1)

Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
slist = []
clist = []

def check(numlist, slist, clist):
    for i in range(m):
        if int(numlist[slist[i]]) != clist[i]:
            return False
    return True

for i in range(m):
    s,c = map(int, input().split())
    slist.append(s-1)
    clist.append(c)
flag = 0
# if m > n:
#     print(-1)
# else:
    for num in range(10**(n-1), 10**n):
        numstring = str(num)
        numlist = list(numstring)
        if check(numlist, slist, clist):
            print(num)
            flag = 1
            break
    if not flag:
        print(-1)



Fixed submission:
n, m = map(int, input().split())
slist = []
clist = []

def check(numlist, slist, clist):
    for i in range(m):
        if int(numlist[slist[i]]) != clist[i]:
            return False
    return True

for i in range(m):
    s,c = map(int, input().split())
    slist.append(s-1)
    clist.append(c)

start = 10**(n-1)
end = 10**n
if n == 1:
    start = 0
flag = 0
for num in range(start, end):
    numstring = str(num)
    numlist = list(numstring)
    if check(numlist, slist, clist):
        print(num)
        flag = 1
        break
if not flag:
    print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
def local_min(seq, i):
    m = seq[0]
    for k in range(1,i+1):
        if seq[k] < m:
            m = seq[k]
    return m


def low_elements(seq):
    count = 1
    for l in range(1, len(seq)):
        if seq[l] <= local_min(seq, l-1):
            count += 1
    return count


n = int(input())
seq1 = list(map(int, input().split()))
print(low_elements((seq1)))


Fixed submission:
def low_elements(seq):
    count = 1
    m = seq[0]
    for l in range(1, len(seq)):
        if seq[l] <= m:
            count += 1
            m = seq[l]
    return count


n = int(input())
seq1 = list(map(int, input().split()))
print(low_elements((seq1)))

Buggy python submission (verdict: Time Limit Exceeded):
def low_elements(seq):
    count = 0
    for i in range(len(seq)):
        count += 1
        for j in range(i):
            if seq[j] < seq[i] :
                count -= 1
                break
    return count


n = int(input())
seq1 = list(map(int, input().split()))
print(low_elements((seq1)))

Fixed submission:
def low_elements(seq):
    count = 1
    m = seq[0]
    for l in range(1, len(seq)):
        if seq[l] <= m:
            count += 1
            m = seq[l]
    return count


n = int(input())
seq1 = list(map(int, input().split()))
print(low_elements((seq1)))
Buggy python submission (verdict: Runtime Error):
n = int(input())
list1 = list(map(int,input().split()))

def count(n, list1):
    num0 = list1.count(0)
    if num0 == 2 or num0 == 3:
        statuslist = []
        answer = 1
        for i in range(len(list1)):
            if list1[i] == 0:
                statuslist.append(0)
            else:
                pos = statuslist.count(list1[i]-1)
                answer *= pos
                statuslist.remove(list1[i]-1)
                statuslist.append(list1[i])
        answer *= 6
        return (answer % 1000000007)
    else:
        return 3
        

print(count(n, list1))

Fixed submission:
n = int(input())
list1 = list(map(int,input().split()))

def count(n, list1):
    num0 = list1.count(0)
    statuslist = []
    answer = 1
    if num0 >= 4:
        return 0
    else:
        for i in range(len(list1)):
            if list1[i] == 0:
                    statuslist.append(0)
            else:
                pos = statuslist.count(list1[i]-1)
                answer *= pos
                try:
                    statuslist.remove(list1[i]-1)
                except ValueError:
                    return answer
                statuslist.append(list1[i])
        if num0 == 2 or num0 == 3:
            answer *= 6
        elif num0 == 1:
            answer *= 3  
        return (answer % 1000000007)
    # else:
    #     return 3
        

print(count(n, list1))
Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = map(int, input().split())
correct = []
for j in range(q):
    correct.append(int(input()))
score = [k]*n
for h in range(q):
    score = list(map(lambda x: x-1, score))
    score[correct[h]-1] += 1
for i in range(n):
    if score[i] > 0:
        print("Yes")
    else:
        print("No")

Fixed submission:
n, k, q = map(int, input().split())
correct = []
for j in range(q):
    correct.append(int(input()))
score = [k-q]*n
for h in range(q):
    score[correct[h]-1] += 1
for i in range(n):
    if score[i] > 0:
        print("Yes")
    else:
        print("No")

Buggy python submission (verdict: Time Limit Exceeded):
n, k, q = map(int, input().split())
mem = [i+1 for i in range(n)]
correct = []
for j in range(q):
    correct.append(int(input()))
score = [k]*n
for h in range(len(correct)):
    score = list(map(lambda x: x-1, score))
    score[correct[h]-1] += 1
for i in range(len(mem)):
    if score[i] > 0:
        print("Yes")
    else:
        print("No")
        

Fixed submission:
n, k, q = map(int, input().split())
correct = []
for j in range(q):
    correct.append(int(input()))
score = [k-q]*n
for h in range(q):
    score[correct[h]-1] += 1
for i in range(n):
    if score[i] > 0:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Runtime Error):
num1 = int(input()) 
num2 = int(input())
num3=int(input())
print(num3 + " "+ num1 + " "+ num2)

Fixed submission:
arvud = input()

arvu=arvud.split(" ")
arv1=arvu[0]
arv2=arvu[1]
arv3=arvu[2]

print(arv3+ " "+ arv1+ " "+ arv2)