Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
for i in range(x):
    for i in range(y):
        print("#", end="")
        print()


Fixed submission:
import sys
import os
 
 
for line in sys.stdin:
    H, W = map(int, line.split())
    if H == 0 and W == 0:
        break
    print(('#' * W + '\n') * H)

Buggy python submission (verdict: Runtime Error):
for i in range(x):
    for i in range(y):
        print("#", end="")
        print()


Fixed submission:
import sys
import os
 
 
for line in sys.stdin:
    H, W = map(int, line.split())
    if H == 0 and W == 0:
        break
    print(('#' * W + '\n') * H)

Buggy python submission (verdict: Runtime Error):
for i in range(x):
    for i in range(y):
        print("#", end="")
        print()


Fixed submission:
import sys
import os
 
 
for line in sys.stdin:
    H, W = map(int, line.split())
    if H == 0 and W == 0:
        break
    print(('#' * W + '\n') * H)

Buggy python submission (verdict: Runtime Error):
while True:
    x,y = map(int,input().split())
    if H==W==0:
        break;
    for i in range(x):
        print("#"*y)
    print()



Fixed submission:
import sys
import os
 
 
for line in sys.stdin:
    H, W = map(int, line.split())
    if H == 0 and W == 0:
        break
    print(('#' * W + '\n') * H)

Buggy python submission (verdict: Runtime Error):
while True:
    x,y = map(int,input().split())
    if H==W==0:
        break;
    for i in range(x):
        print("#"*y)
    print()



Fixed submission:
import sys
import os
 
 
for line in sys.stdin:
    H, W = map(int, line.split())
    if H == 0 and W == 0:
        break
    print(('#' * W + '\n') * H)

Buggy python submission (verdict: Runtime Error):
while True:
    x,y = map(int,input().split())
    if H==W==0:
        break;
    for i in range(x):
        print("#"*y)
    print()



Fixed submission:
import sys
import os
 
 
for line in sys.stdin:
    H, W = map(int, line.split())
    if H == 0 and W == 0:
        break
    print(('#' * W + '\n') * H)
Buggy python submission (verdict: Runtime Error):
for i in range(100000):
    H,W = map(int,input().split(" "))
    if H + W == 0:
        break
    print("#"*W)
    for j in range(h-2):
        print("#" + "."*(W-2) + "#")
    print("#"*W)
    print("")
    


Fixed submission:
while True:
    H,W = map(int, input().split())
    if H == W == 0: break
    print("#"*W)
    print(("#"+"."*(W-2)+"#\n")*(H-2),end="")
    print("#"*W+"\n")
Buggy python submission (verdict: Runtime Error):
while True:
 x,y =map(int, input().split())
 if x==0 and y==0:
   break
 if x>y:
   print(y,x)
 else:
   print(x,y)


Fixed submission:
c = 1
while True:
 x = int(input())
 if x ==0:
   break
 print("Case ",c,": ",x,sep="")
 c += 1

Buggy python submission (verdict: Runtime Error):
while True:
  x,y =map(int, input().split())
  if x==0 and y==0:
    break
  if x>y:
    print(y,x)
  else:
     print(x,y)


Fixed submission:
c = 1
while True:
 x = int(input())
 if x ==0:
   break
 print("Case ",c,": ",x,sep="")
 c += 1

Buggy python submission (verdict: Runtime Error):
c=1
while True:
 if x ==0:
   break
 print("Case ",c,": ",x,sep="")
 c += 1



Fixed submission:
c = 1
while True:
 x = int(input())
 if x ==0:
   break
 print("Case ",c,": ",x,sep="")
 c += 1
Buggy python submission (verdict: Runtime Error):
from math import pi
r = float(input())
area = r * r * pi
cir = (r+r) * pi
pirnt(f'{(area):.6f} {(cir):.6f}')


Fixed submission:
from math import pi
r = float(input())
area = r * r * pi
cir = (r+r) * pi
print(f'{(area):.6f} {(cir):.6f}')
Buggy python submission (verdict: Runtime Error):
a=input()
b=split()
d=list()
for c in b:
    d.append(int(c))
print(d[0]*d[1],2*d[0]+2*d[1])


Fixed submission:
a=input()
b=a.split()
d=list()
for c in b:
    d.append(int(c))
print(d[0]*d[1],2*d[0]+2*d[1])

Buggy python submission (verdict: Runtime Error):
a=input()
b=split(a)
d=list()
for c in b:
    d.append(int(c))
print(d[0]*d[1],2*d[0]+2*d[1])


Fixed submission:
a=input()
b=a.split()
d=list()
for c in b:
    d.append(int(c))
print(d[0]*d[1],2*d[0]+2*d[1])
Buggy python submission (verdict: Runtime Error):
count=0
while True:
    count+=1
    a=input()
    if a==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))


Fixed submission:
count=1
while True:
    a=input()
    a=int(a)
    if a==0:
        break
    print("Case {}: {}".format(count,a))
    count+=1

Buggy python submission (verdict: Runtime Error):
count=0
while True:
    count+=1
    a=input()
    if a==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))



Fixed submission:
count=1
while True:
    a=input()
    a=int(a)
    if a==0:
        break
    print("Case {}: {}".format(count,a))
    count+=1

Buggy python submission (verdict: Runtime Error):
count=0
while True:
    count+=1
    a=input()
    if a==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))



Fixed submission:
count=1
while True:
    a=input()
    a=int(a)
    if a==0:
        break
    print("Case {}: {}".format(count,a))
    count+=1

Buggy python submission (verdict: Runtime Error):
count=0
while True:
    count+=1
    a=input()
    if a==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))



Fixed submission:
count=1
while True:
    a=input()
    a=int(a)
    if a==0:
        break
    print("Case {}: {}".format(count,a))
    count+=1

Buggy python submission (verdict: Runtime Error):
count=0
while 1:
    count+=1
    a=input()
    if a==0:
        break
    else:
        print("Case "+str(count)+": "+str(a))



Fixed submission:
count=1
while True:
    a=input()
    a=int(a)
    if a==0:
        break
    print("Case {}: {}".format(count,a))
    count+=1
Buggy python submission (verdict: Runtime Error):
s=input()
p=input()
sl = [i for i in s]
pl = [i for i in p]
lenp=len(p)
pp=pl[-1]
pcheck=-1
el=[i for i,x in enumerate(sl) if x==pp]
check=0
for i in el:
    while True:
        if sl[i]==pl[pcheck]:
            i-=1
            pcheck-=1
        else:
            break
        if pcheck+lenp==0:
            check+=1
            break
if check==0:
    print("No")
else:
    print("Yes")



Fixed submission:
s=input()
p=input()
sl = [i for i in s]
pl = [i for i in p]
lenp=len(p)
pp=pl[-1]
el=[i for i,x in enumerate(sl) if x==pp]
check=0
for i in el:
    pcheck=-1
    while True:
        if sl[i]==pl[pcheck]:
            i-=1
            pcheck-=1
        else:
            break
        if pcheck+lenp<=0:
            check+=1
            break
    if check==1:
        break
if check==0:
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
s=input()
p=input()
sl = [i for i in s]
pl = [i for i in p]
lenp=len(p)
pp=pl[-1]
pcheck=-1
el=[i for i,x in enumerate(sl) if x==pp]
check=0
for i in el:
    while True:
        if sl[i]==pl[pcheck]:
            i-=1
            pcheck-=1
        else:
            break
        if pcheck+lenp==0:
            check+=1
            break
    if check==1:
        break
if check==0:
    print("No")
else:
    print("Yes")



Fixed submission:
s=input()
p=input()
sl = [i for i in s]
pl = [i for i in p]
lenp=len(p)
pp=pl[-1]
el=[i for i,x in enumerate(sl) if x==pp]
check=0
for i in el:
    pcheck=-1
    while True:
        if sl[i]==pl[pcheck]:
            i-=1
            pcheck-=1
        else:
            break
        if pcheck+lenp<=0:
            check+=1
            break
    if check==1:
        break
if check==0:
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
w=input()
ll=list()
while True:
    T=input()
    T=T.lower()
    if T=="END_OF_TEXT":
        break
    t=T.split()
    for i in t:
        ll.append(i)
ans=ll.count(w)
print(ans)



Fixed submission:
w=input()
ll=list()
while True:
    T=input()
    if T=="END_OF_TEXT":
        break
    T=T.lower()
    t=T.split()
    for i in t:
        ll.append(i)
ans=ll.count(w)
print(ans)
Buggy python submission (verdict: Runtime Error):
while True:
    #審判の数
    n = int(input())
    if n == 0:
        break
    while n >= 3 and n <= 100: #審判の数は３〜１００人
        a = [0]*n               #空いてる配列
        for i in range(n):       #空いてる配列に点数を入れる
            s = int(input())
            a[i] = s
        tensu = (sum(a) - min(a) -max(a))/(len(a)-2) #一番でかい点数と一番小さい点数は一つずつ引いて平均
        print(int(tensu))        #平均点！


Fixed submission:
while True:
    #審判の数
    n = int(input())
    if n == 0:
        break
    a = [0]*n               #空いてる配列
    for i in range(n):       #空いてる配列に点数を入れる
        s = int(input())
        a[i] = s
    tensu = (sum(a) - min(a) -max(a))/(len(a)-2) #一番でかい点数と一番小さい点数は一つずつ引いて平均
    print(int(tensu))        #平均点！
Buggy python submission (verdict: Time Limit Exceeded):
num = int(input())

dp = { 0: 1, 1: 1 }
def fibonacci(n):
  return dp[n] if n in dp else fibonacci(n - 1) + fibonacci(n - 2)

print(fibonacci(num))



Fixed submission:
num = int(input())

dp = { 0: 1, 1: 1 }
def fibonacci(n):
  if not n in dp:
    dp[n] = fibonacci(n - 1) + fibonacci(n - 2)
  return dp[n]

print(fibonacci(num))
Buggy python submission (verdict: Runtime Error):
n = int(input())

before = int(input())
current = int(input())
diffMax = current - before
for i in range(n - 1):
  number = int(input())
  diff = number - current
  diffMax = max(diff, diffMax)
  current = min(current, number)
print(diffMax)



Fixed submission:
n = int(input())

value1 = int(input())
value2 = int(input())
maxDiff = value2 - value1
minValue = min(value1, value2)
for i in range(n - 2):
  value = int(input())
  diff = value - minValue
  maxDiff = max(diff, maxDiff)
  minValue = min(value, minValue)
print(maxDiff)
Buggy python submission (verdict: Runtime Error):
n = raw_input()
print n**3

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

Buggy python submission (verdict: Runtime Error):
n = raw_input()
print n**3

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

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

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

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

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

Buggy python submission (verdict: Runtime Error):
n = int(raw_input())
print(n**3)

Fixed submission:
x = int(input())
print(x**3)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
def S:
	return a*b
	return 2*(a+b)
print S

Fixed submission:
a,b = list(map(int, input().split()))
print(a*b, 2*(a+b))

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

Fixed submission:
a,b = list(map(int, input().split()))
print(a*b, 2*(a+b))

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

Fixed submission:
a,b = list(map(int, input().split()))
print(a*b, 2*(a+b))

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

Fixed submission:
a,b = list(map(int, input().split()))
print(a*b, 2*(a+b))
Buggy python submission (verdict: Runtime Error):
S = int(input())
h = S//3600
m = (S-3600*h)//60
s = S-3600*h-60*m
print(str(h)+":"+str(m)+":"+s

Fixed submission:
S = int(input())
h = S//3600
m = (S-3600*h)//60
s = S-3600*h-60*m
print(str(h)+":"+str(m)+":"+str(s))
Buggy python submission (verdict: Runtime Error):
while 1:
    nm = map(int, raw_input().split())
    if nm == [0, 0]:
	break
    n = nm[0]
    m = nm[1]
    p = map(int, raw_input().split())
    p_sorted = sorted(p)
    sum = 0
    for i in range(n):
        if (i+1) % m != 0:
	    sum += p_sorted[-1-i]
    print sum

Fixed submission:
while 1:
    try:
        nm = map(int, raw_input().split())
        if nm == [0, 0]:
            break
        n = nm[0]
        m = nm[1]
        p = map(int, raw_input().split())
        p_sorted = sorted(p)
        sum = 0
        for i in range(n):
            if (i+1) % m != 0:
                sum += p_sorted[-1-i]
        print sum
    except:
	pass

Buggy python submission (verdict: Runtime Error):
while 1:
    nm = map(int, raw_input().split())
    if nm == [0, 0]:
        break
    n = nm[0]
    m = nm[1]
    p = map(int, raw_input().split())
    p_sorted = sorted(p)
    sum = 0
    for i in range(n):
        if (i+1) % m != 0:
            sum += p_sorted[-1-i]
    print sum

Fixed submission:
while 1:
    try:
        nm = map(int, raw_input().split())
        if nm == [0, 0]:
            break
        n = nm[0]
        m = nm[1]
        p = map(int, raw_input().split())
        p_sorted = sorted(p)
        sum = 0
        for i in range(n):
            if (i+1) % m != 0:
                sum += p_sorted[-1-i]
        print sum
    except:
	pass
Buggy python submission (verdict: Runtime Error):
def prime(a):
    prime = []
    for p in range(2, a):
        if a % p == 0:
            prime.append(p)
            while a % p == 0:
                a /= p
    return prime

def keynumber(prime):
    sum = 0
    for i in range(len(prime) - 1):
        sum += prime[i]
    key = prime[-1] - sum
    return key

while 1:
    ab = raw_input().split()
    a = int(ab[0])
    b = int(ab[1])
    if a == 0 and b == 0:
        break
    pa = prime(a)
    pb = prime(b)
    ka = keynumber(pa)
    kb = keynumber(pb)
    if ka > kb:
        print('a')
    else:
        print('b')

Fixed submission:
def prime(a):
    prime = []
    for p in range(2, a+1):
        if a % p == 0:
            prime.append(p)
            while a % p == 0:
                a /= p
    return prime

def keynumber(prime):
    sum = 0
    for i in range(len(prime) - 1):
        sum += prime[i]
    key = prime[-1] - sum
    return key

while 1:
    ab = raw_input().split()
    a = int(ab[0])
    b = int(ab[1])
    if a == 0 and b == 0:
        break
    pa = prime(a)
    pb = prime(b)
    ka = keynumber(pa)
    kb = keynumber(pb)
    if ka > kb:
        print('a')
    else:
        print('b')
Buggy python submission (verdict: Runtime Error):
import itertools as it

T = input()

def goodset(a, b, c):
    return (a == b and b == c) or (a + 1 == b and b + 1 == c)

def win(c):
    return goodset(c[0], c[1], c[2]) and goodset(c[3], c[4], c[5]) and goodset(c[6], c[7], c[8])

for i in range(T):
    cards = map(int, raw_input().split())
    color = raw_input().split()
    for j in range(9):
        if color[j] == "G":
            cards[j] += 100
        elif color[j] == "B":
            cards[j] += 200
    w = 0
    for p in it.permutations(range(9)):
        c = [cards[p[j]] for j in range(9)]
        if win(c):
            w = 1
            break
    print w

Fixed submission:
import itertools as it

T = input()

def goodset(a, b, c):
    return (a == b and b == c) or (a + 1 == b and b + 1 == c)

def win(c):
    return goodset(c[0], c[1], c[2]) and goodset(c[3], c[4], c[5]) and goodset(c[6], c[7], c[8])

for i in range(T):
    cards = map(int, raw_input().split())
    color = raw_input().split()
    for j in range(9):
        if color[j] == "G":
            cards[j] += 100
        elif color[j] == "B":
            cards[j] += 200
    w = 0
    for c in it.permutations(cards):#range(9)):
        #c = [cards[p[j]] for j in range(9)]
        if win(c):
            w = 1
            break
    print w
Buggy python submission (verdict: Runtime Error):
nq = map(int, raw_input().split())
n = nq[0]
q = nq[1]

yn = [[1, 'kogakubu10gokan']]

for i in range(n):
    yn.append(raw_input().split())

y = 1
k = 0
while y <= q:
    k += 1
    y = int(yn[k][0])

print yn[k-1][1]

Fixed submission:
nq = map(int, raw_input().split())
n = nq[0]
q = nq[1]

yn = [[1, 'kogakubu10gokan']]

for i in range(n):
    yn.append(raw_input().split())

yn.append([100,''])

y = 1
k = 0
while y <= q:
    k += 1
    y = int(yn[k][0])

print yn[k-1][1]
Buggy python submission (verdict: Runtime Error):
S = []

try:
    word = raw_input()
    
    while 1:
        if word == "+":
            s1 = S.pop()
            s2 = S.pop()
            S.append(s1 + s2)
        elif word == "-":
            s1 = S.pop()
            s2 = S.pop()
            S.append(s2 - s1)
        elif word == "*":
            s1 = S.pop()
            s2 = S.pop()
            S.append(s2 * s1)
        else:
            S.append(int(word))
        word = raw_input()

except:
    print S.pop()

Fixed submission:
S = []

W = raw_input().split()
    
for word in W:
    if word == "+":
        s1 = S.pop()
        s2 = S.pop()
        S.append(s1 + s2)
    elif word == "-":
        s1 = S.pop()
        s2 = S.pop()
        S.append(s2 - s1)
    elif word == "*":
        s1 = S.pop()
        s2 = S.pop()
        S.append(s2 * s1)
    else:
        S.append(int(word))

print S.pop()
Buggy python submission (verdict: Time Limit Exceeded):
import sys
numbers = []
for line in sys.stdin:
	numbers.append(int(line))

max = numbers[2] - numbers[1]


for i in range(1, len(numbers) - 1):
	for j in range(i + 1, len(numbers)):
		if numbers[j] - numbers[i] > max :
			max = numbers[j] - numbers[i]
print(max)


Fixed submission:
import sys
numbers = []
for line in sys.stdin:
	numbers.append(int(line))

answer = numbers[2] - numbers[1]
tmp_min = numbers[1]
for target in range(2, len(numbers)):
	answer =  max(numbers[target] - tmp_min ,answer)
	tmp_min = min(numbers[target] , tmp_min)

print(answer)

Buggy python submission (verdict: Runtime Error):
numbers = []
for line in sys.stdin:
	numbers.append(int(line))

answer = numbers[2] - numbers[1]

count = 1
while count < len(numbers) - 1:
	target = max(numbers[count : ])
	if target -  numbers[count] > answer :
		answer = target -  numbers[count]
	count += count

print(answer)


Fixed submission:
import sys
numbers = []
for line in sys.stdin:
	numbers.append(int(line))

answer = numbers[2] - numbers[1]
tmp_min = numbers[1]
for target in range(2, len(numbers)):
	answer =  max(numbers[target] - tmp_min ,answer)
	tmp_min = min(numbers[target] , tmp_min)

print(answer)

Buggy python submission (verdict: Time Limit Exceeded):
import sys
numbers = []
for line in sys.stdin:
	numbers.append(int(line))

answer = numbers[2] - numbers[1]

count = 1
while count < len(numbers) - 1:
	target = max(numbers[count + 1 : ])
	if target -  numbers[count] > answer :
		answer = target -  numbers[count]
	count += 1

print(answer)


Fixed submission:
import sys
numbers = []
for line in sys.stdin:
	numbers.append(int(line))

answer = numbers[2] - numbers[1]
tmp_min = numbers[1]
for target in range(2, len(numbers)):
	answer =  max(numbers[target] - tmp_min ,answer)
	tmp_min = min(numbers[target] , tmp_min)

print(answer)
Buggy python submission (verdict: Runtime Error):
import sys
input_number = int(raw_input())
if __name__ == '__main__':
    print(str(input_number ** 3))



Fixed submission:
import sys
input_number = int(input())
if __name__ == '__main__':
    print(str(input_number ** 3))

Buggy python submission (verdict: Runtime Error):
import sys
input_number = int(raw_input())

if __name__ == '__main__':
    print(str(input_number ** 3))



Fixed submission:
import sys
input_number = int(input())
if __name__ == '__main__':
    print(str(input_number ** 3))
Buggy python submission (verdict: Runtime Error):
while True:
    N = int(input())
    if 3
    N == 0:
        break
    S = []
    for i in range(N):
        S.append(int(input()))
    print((sum(S) - max(S) - min(S))//(len(S)-2))


Fixed submission:
while True:
    N = int(input())
    if N == 0:
        break
    S = []
    for i in range(N):
        S.append(int(input()))
    print((sum(S) - max(S) - min(S))//(len(S)-2))
Buggy python submission (verdict: Runtime Error):
input(x)
print(x ** 3)

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

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

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

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

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

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

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

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

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

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

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

Buggy python submission (verdict: Runtime Error):
x = input()
pow(x, 3)

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

Buggy python submission (verdict: Runtime Error):
x = input()
y = pow(x, 3)
print(y)

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

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

Fixed submission:
x = int(input())
print(x ** 3)
Buggy python submission (verdict: Runtime Error):
import math
x1,y1,x2,y2 = map(int,input().split())
print(math.sqrt((x2-x1)**2+(y2-y1)**2))



Fixed submission:
import math
x1,y1,x2,y2 = map(float,input().split())
print('{0:.5f}'.format(math.sqrt((x2-x1)**2+(y2-y1)**2)))

Buggy python submission (verdict: Runtime Error):
import math
x1,y1,x2,y2 = map(int,input().split())
print('{0:.5f}'.format(math.sqrt((x2-x1)**2+(y2-y1)**2)))



Fixed submission:
import math
x1,y1,x2,y2 = map(float,input().split())
print('{0:.5f}'.format(math.sqrt((x2-x1)**2+(y2-y1)**2)))
Buggy python submission (verdict: Runtime Error):
from math import pi
r = int(input())
print('{0:0.8f} {1:0.8f}'.format(r*r*pi,2*pi*r))



Fixed submission:
from math import pi
r = float(input())
print('{0:.5f} {1:.5f}'.format(r*r*pi,2*pi*r))
Buggy python submission (verdict: Runtime Error):
n = int(input())
min = 1000000; max = -1000000; sum = 0;

for i in range(n):
    x = int(input())
    sum += x
    if min > x:
        min = x
    if max < x:
        max = x
print('{0} {1} {2}'.format(min,max,sum))




Fixed submission:
n = int(input())
data = list(map(int,input().split()))
print('{0} {1} {2}'.format(min(data),max(data),sum(data)))
Buggy python submission (verdict: Runtime Error):
while True:
    h,w = map(int,input().split())
    if h==0 and w==0: break

    for i in range(h):
        for j in range(w):
            if (i+j)%2==0: print('#',end=='')
            else: print('.',end=='')
            if j==w-1: print()
    print()
    



Fixed submission:
while True:
    h,w = map(int,input().split())
    if h==0 and w==0: break

    for i in range(h):
        s = ''
        for j in range(w):
            if (i+j)%2==0: s += '#'
            else: s+='.'
        print(s)
    print()
Buggy python submission (verdict: Runtime Error):
import numpy as np
n,m = map(int,input().split())
a = np.zeros((n,m))
b = np.zeros(m)
for i in range(n):
    x = list(map(int,input().split()))
    for j in range(m):
        a[i][j] = x[j]
for i in range(m):
    b[i] = int(input())
c = np.dot(a,b)
for x in c:
    print(int(x))



Fixed submission:
n,m = map(int,input().split())
a = []; b= [];
for i in range(n): a.append(list(map(int,input().split())))
for i in range(m): b.append(int(input()))
for i in range(n):
    c = 0
    for j in range(m):
        c += a[i][j]*b[j]
    print(c)
Buggy python submission (verdict: Runtime Error):
while True:
    a,b,c = map(int,input().split())
    if a == b == c == -1: break
    if a+b>=80: print('A')
    elif 65 <= a+b < 80: print('B')
    elif 50 <= a+b < 65: print('C')
    elif 30 <= a+b < 50:
        if r<=50: print('C')
        else:     print('D')
    elif a+b<30: print('F')
    



Fixed submission:
while True:
    a,b,c = map(int,input().split())
    if a == b == c == -1: break
    if a==-1 or b==-1:
        print('F')
        continue
    if 80 <= a+b:
        print('A')
        continue
    elif 65 <= a+b:
        print('B')
        continue
    elif 50 <= a+b:
        print('C')
        continue
    elif 30 <= a+b:
        if 50 <= c:
            print('C')
            continue
        else:
            print('D')
            continue
    elif a+b<30: print('F')