Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
A,B=map(int,input().split())
if (A==2 or B==2:
    print("No")
else:
    print("Yes")

Fixed submission:

A,B=map(int,input().split())
if A==2 or B==2:
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
A,B=map(int,input().split())
if (A==2 or B==2:
    print("No")
else:
    print("Yes")

Fixed submission:

A,B=map(int,input().split())
if A==2 or B==2:
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
N,K = map(int,input().split())
if N%K==0:
    print(0)
else:
    print(

Fixed submission:
N,K = map(int,input().split())
if N%K==0:
    print(0)
else:
    print(1)
Buggy python submission (verdict: Runtime Error):
n=int(input())
if n==1:
    print("Hello World")
else:
    a,b=map(int,input().split())
    print(a+b)


Fixed submission:
n=int(input())
if n==1:
    print("Hello World")
else:
    a=int(input())
    b=int(input())
    print(a+b)
Buggy python submission (verdict: Runtime Error):
text = input()
textdata = list(map(int, text.split()))
route_num = textdata[0]
time_lim = textdata[1]
candidate = []

for i in range(route_num):
    if textdata[2*(i+1)+1] > time_lim:
        continue
    else:
        candidate += [textdata[2*(i+1)]]
        
if len(candidate)==0:
    print("TLE")
else:
    print("{}".format(min(candidate)))

Fixed submission:
textdata = list(map(int, input().split()))
route_num = textdata[0]
time_lim = textdata[1]
candidate = []

ctlist = [list(map(int, input().split())) for _ in range(route_num)]

for c, t in ctlist:
    if t > time_lim:
        continue
    else:
        candidate += [c]
        
if len(candidate)==0:
    print("TLE")
else:
    print(min(candidate))
Buggy python submission (verdict: Runtime Error):
N = int(input())

x_list=[]
y_list=[]
h_list=[]

def all_same(items):
	return all(map(lambda x: x == items[0], items))

for i in range(N):
	x,y,h=map(int, input().split())
	x_list.append(x)
	y_list.append(y)
	h_list.append(h)	
		
for cy in range(N+1):
	for cx in range(N+1):
		H_list = []
		for i in range(N):
			if h_list[i] != 0:
				H = abs(cx - x_list[i])+abs(cy - y_list[i])+h_list[i]
				H_list.append(H) 
			if h_list[i] == 0:
				H = abs(cx - x_list[i])+abs(cy - y_list[i])+h
				if H > 0:
					break
		else:
			if all_same(H_list):
				print(str(cx)+' '+str(cy)+' '+str(H_list[0]))
				break
		break				
	else:
		continue
	break

				
			
			

Fixed submission:
N = int(input())
if N == 1:
	print('Hello World')
elif N == 2:
	A = int(input())	
	B = int(input())
	print(A+B)
Buggy python submission (verdict: Runtime Error):
import numpy as np
N,T = map(int, input().split())

c_list = []
t_list=[]
for i in range(N):
	c,t=map(int, input().split())
	c_list.append(c)
	t_list.append(t)

c_list = np.array(c_list)
t_list = np.array(t_list)	

if t_list[t_list<=T]:
	print('TLE')
else:
	print(min(c_list[t_list<=T]))

Fixed submission:
import numpy as np
N,T = map(int, input().split())

c_list = []
t_list=[]
for i in range(N):
	c,t=map(int, input().split())
	c_list.append(c)
	t_list.append(t)

c_list = np.array(c_list)
t_list = np.array(t_list)	

if not np.any(t_list[t_list<=T]):
	print('TLE')
else:
	print(min(c_list[t_list<=T]))
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env pypy3


def get_line():
    return input()


def get_tokens():
    return get_line().split()


def get_ints():
    return [int(_) for _ in get_tokens()]


def main():

    n, = get_ints()
    A, = get_ints()
    B, = get_ints()
    print('Hello World' if n == 1 else A + B)

if __name__ == '__main__':
    main()

Fixed submission:
#!/usr/bin/env pypy3


def get_line():
    return input()


def get_tokens():
    return get_line().split()


def get_ints():
    return [int(_) for _ in get_tokens()]


def main():

    n, = get_ints()
    if n == 1:
        print('Hello World')
    else:    
        A, = get_ints()
        B, = get_ints()
        print(A+B)
        
if __name__ == '__main__':
    main()

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


n, m = map(int, input().split())

for i in range(math.floor(m/n), 0, -1):
    if m % i == 0:
        ans = i
		break

print(ans)


Fixed submission:
# encoding: utf-8
n = int(input())
if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a + b)
Buggy python submission (verdict: Time Limit Exceeded):
# encoding: utf-8
import itertools


n = int(input())
xlist = []
ylist = []
hlist = []
for i in range(n):
	xtmp, ytmp, htmp = map(int, input().split())
	xlist.append(xtmp)
	ylist.append(ytmp)
	hlist.append(htmp)
h = max(hlist)
end_flag = False
while True:
	for cx, cy in itertools.product(range(101), range(101)):
		if all([hlist[i] == max(h - abs(xlist[i] - cx) - abs(ylist[i] - cy), 0) for i in range(n)]):
			print('{} {} {}'.format(cx, cy, h))
			end_flag = True
			break
	if end_flag:
		break
	h += 1


Fixed submission:
# encoding: utf-8
import itertools


n = int(input())
xlist = []
ylist = []
hlist = []
for i in range(n):
	xtmp, ytmp, htmp = map(int, input().split())
	xlist.append(xtmp)
	ylist.append(ytmp)
	hlist.append(htmp)
h = max(hlist)
end_flag = False
while True:
	for cx, cy in itertools.product(range(101), range(101)):
		if all([hlist[i] == max(h - abs(xlist[i] - cx) - abs(ylist[i] - cy), 0) for i in range(n)]):
			print('{} {} {}'.format(cx, cy, h))
			end_flag = True
			break
	if end_flag:
		break
	h += 1

Buggy python submission (verdict: Time Limit Exceeded):
# encoding: utf-8
import itertools


n = int(input())
xlist = []
ylist = []
hlist = []
for i in range(n):
	xtmp, ytmp, htmp = map(int, input().split())
	xlist.append(xtmp)
	ylist.append(ytmp)
	hlist.append(htmp)
h = 0
end_flag = False
while True:
	for cx, cy in itertools.product(range(101), range(101)):
		if all([hlist[i] == max(h - abs(xlist[i] - cx) - abs(ylist[i] - cy), 0) for i in range(n)]):
			print('{} {} {}'.format(cx, cy, h))
			end_flag = True
			break
	if end_flag:
		break
	h += 1

Fixed submission:
# encoding: utf-8
import itertools


n = int(input())
xlist = []
ylist = []
hlist = []
for i in range(n):
	xtmp, ytmp, htmp = map(int, input().split())
	xlist.append(xtmp)
	ylist.append(ytmp)
	hlist.append(htmp)
h = max(hlist)
end_flag = False
while True:
	for cx, cy in itertools.product(range(101), range(101)):
		if all([hlist[i] == max(h - abs(xlist[i] - cx) - abs(ylist[i] - cy), 0) for i in range(n)]):
			print('{} {} {}'.format(cx, cy, h))
			end_flag = True
			break
	if end_flag:
		break
	h += 1
Buggy python submission (verdict: Time Limit Exceeded):
import math


n, m = map(int, input().split())

for i in range(1, math.floor(m/n) + 1):
    if m % i == 0:
        ans = i

print(ans)

Fixed submission:
import math


n, m = map(int, input().split())

for i in range(math.floor(m/n), 0, -1):
    if m % i == 0:
        ans = i
        break

print(ans)
Buggy python submission (verdict: Runtime Error):
import copy
import itertools

N, X = map(int, input().split())
xlist = [int(i) for i in input().split()]

def pairwise(iterable):
    "s -> (s0,s1), (s1,s2), (s2, s3), ..."
    a, b = itertools.tee(iterable)
    next(b, None)
    return zip(a, b)
  
def calc_energy(path):
  ret = 0
  k = 0
  for pair in pairwise(path):
    ret += (k + 1) ** 2 * abs(pair[0] - pair[1])
    ret += X
    if pair[1] == 0:
      k = 0
    else:
      k += 1
  return ret

def movepath(cur, last):
  if not last:
    yield calc_energy(cur)
  else:
    if cur[-1] == 0:
      for i in last:
        newlast = copy.copy(last)
        for ret in movepath(cur + [i], newlast):
          yield ret
    else:
      newlast = copy.copy(last)
      newlast.remove(cur[-1])
      for i in [0] + newlast:
       	for ret in movepath(cur + [i], newlast):
          yield ret

print(min(calc_energy(path) for path in movepath([0], xlist)))

Fixed submission:
n, x = map(int, input().split())
children = [int(i) for i in input().split()]
children.sort()
count = 0
for child in children:
  if x < child:
    break
  else:
    x -= child
    count += 1
if count == n and x != 0:
  count -= 1
print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
cake = 4
donut = 7
ac = False
for i in range(25):
    for j in range(14):
        if N == (cake * i + donut * j):
            ac = True
if ac:
    print('Yes')
else:
    print('No)

Fixed submission:
N = int(input())
cake = 4
donut = 7
ac = False
for i in range(25):
    for j in range(14):
        if N == (cake * i + donut * j):
            ac = True
if ac:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
cake = 4
donut = 7
ac = False
for i in range(25):
    for j in range(14):
        if N == (cake * i + donut * j):
            ac = True
            exit()
if ac:
    print('Yes')
else:
    print('No)

Fixed submission:
N = int(input())
cake = 4
donut = 7
ac = False
for i in range(25):
    for j in range(14):
        if N == (cake * i + donut * j):
            ac = True
if ac:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
N = input()
A = input()
FLG = 0
for i in range(A):
  if (N-i)%500 == 0:
    print('YES')
    FLG = 1
	break
if FLG == 0:
  print('NO')


Fixed submission:
N = int(input())
A = int(input())
if (N%500) > A:
  print('No')
else:
  print('Yes')
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if (a*b) % 2:
  ptint('Odd')
else:
  print('Even')


Fixed submission:
a, b = map(int, input().split())
if (a*b) % 2:
    print("Odd")
else:
    print("Even")

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if (a*b)%2:
  ptint('Odd')
else:
  print('Even')

Fixed submission:
a, b = map(int, input().split())
if (a*b) % 2:
    print("Odd")
else:
    print("Even")
Buggy python submission (verdict: Runtime Error):
import math
a, b = map(int.input().split())
x = (a + b)/2
print(math.ceil(x))


Fixed submission:
import math
a, b = map(int, input().split())
x = (a + b)/2
print(math.ceil(x))

Buggy python submission (verdict: Runtime Error):
import math
a = int(input())
b = int(input())
x = (a + b)/2
print(math.ceil(x))

Fixed submission:
import math
a, b = map(int, input().split())
x = (a + b)/2
print(math.ceil(x))
Buggy python submission (verdict: Runtime Error):
s = input()
for i in s:
  if i == '1':
    c += i
print(c)    

Fixed submission:
s = input()
c = 0
for i in s:
  if i == '1':
    c += 1
print(c)
Buggy python submission (verdict: Runtime Error):
s = input()
c = s.count()
print(s[0:1] + str(c) + s[-1:])

Fixed submission:
s = input()
c = len(s) - 2
print(s[0:1] + str(c) + s[-1:])

Buggy python submission (verdict: Runtime Error):
s = input()
c = s.count()
print(s[1:1] + str(c) + s[-1:1])
  

Fixed submission:
s = input()
c = len(s) - 2
print(s[0:1] + str(c) + s[-1:])
Buggy python submission (verdict: Runtime Error):
s = list(input())
a = 200000
z = 0
for i in range(len(s)):
  if s[i] = 'A' and a > i:
    a = i
  if s[i] = 'Z' and z < i:
    z = i
print(z-a+1)

Fixed submission:
s = list(input())
a = 200000
z = 0
for i in range(len(s)):
  if s[i] == 'A' and a > i:
    a = i
  if s[i] == 'Z' and z < i:
    z = i
print(z-a+1)
Buggy python submission (verdict: Runtime Error):
N,T = map(int, input().split())
minC = 1001
flag = False
for i in range(int(N)):
    c, t = map(int, input().split())
    if int(T) >= t and minC >= int(c):
        minC = c
        frag = True

if(flag == False):
    print("TLE")
else:
    print(minC)

Fixed submission:
N = int(input())
if (N == 1): 
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a+b)

Buggy python submission (verdict: Runtime Error):
N,T = map(int, input().split())
minC = 1001
flag = False
for i in range(int(N)):
    c, t = map(int, input().split())
    if int(T) > t and minC > c:
        minC = c

print(minC)

Fixed submission:
N = int(input())
if (N == 1): 
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a+b)

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
"""
Created on Sat Oct  6 21:37:39 2018

@author: ogura
"""
import math

n, m = map(int, input().split())

for i in range(10000):
    a = math.gcd(m, i)
    if a == 1:
        continue
    tmp = int(a *(1 - a ** n) // (1 - a))
    if tmp == m:
        break

print(a)

Fixed submission:
# -*- coding: utf-8 -*-
"""
Created on Sat Sep 15 21:08:34 2018

@author: ogura
"""

n = int(input())

if n == 1:
    print('Hello World')
elif n == 2:
    a = int(input())
    b = int(input())
    print(a + b)
else:
    ''
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
from fractions import gcd

# スペース区切りの整数の入力
N, X = map(int, input().split())
pos = [int(x.strip()) for x in input().split()]

# 一番近い場所を検索
tikai = [i - X for i in pos]
kyori = list(map(abs,tikai))

a = kyori[0]
for xi in kyori[1:]:
    a = gcd(a, xi)
print(a)

Fixed submission:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a, b = map(int, input().split())

if ((a * b) % 2) == 1:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import functools
import math

# スペース区切りの整数の入力
N, X = map(int, input().split())
pos = [int(x.strip()) for x in input().split()]

# 一番近い場所を検索
tikai = [i - X for i in pos]
kyori = list(map(abs,tikai))

gcd = functools.reduce(math.gcd, kyori)

print(gcd)


Fixed submission:
# -*- coding: utf-8 -*-
from fractions import gcd

# スペース区切りの整数の入力
N, X = map(int, input().split())
pos = [int(x.strip()) for x in input().split()]

# 一番近い場所を検索
tikai = [i - X for i in pos]
kyori = list(map(abs,tikai))

a = kyori[0]
for xi in kyori[1:]:
    a = gcd(a, xi)
print(a)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
s = str(input())
t = str(input())

slen = len(s)
tlen = len(t)

if slen != tlen:
    print('No')
    break

for i in range(slen):
    if s == t:
        print("Yes")
        break
    s = s[-1] + s[:-1]


Fixed submission:
# -*- coding: utf-8 -*-
s = str(input())
t = str(input())

slen = len(s)
tlen = len(t)

if slen != tlen:
    print("No")

for i in range(slen):
    if s == t:
        print("Yes")
        break
    s = s[-1] + s[:-1]

if s != t:
    print("No")
Buggy python submission (verdict: Runtime Error):
import math
N, M = map(int,input().split())
j=1
for i in range(1, int(math.sqrt(M))+2):
    if M%i==0:
        if i <= M//N and j < i:
            j=i
        if M/i <= M//N and j < M/i:
            j=M/i
print(j)


Fixed submission:
N= int(input())
if N==1:
    print("Hello World")
else:
    A= int(input())
    B= int(input())
    print(A+B)
Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int,input().split())
j=1
for i in range(1, M//N + 1):
    if M%i==0:
        j=i
print(j)


Fixed submission:
import math
N, M = map(int,input().split())
j=1
for i in range(1, int(math.sqrt(M))+2):
    if M%i==0:
        if i <= M//N and j < i:
            j=i
        if M//i <= M//N and j < M//i:
            j=M//i
print(j)
Buggy python submission (verdict: Runtime Error):
def gcd(x,y):
    if x>=y:
        if x%y==0:
            return y
        else:
            return gcd(y,x%y)
    else:
        if y%x==0:
            return x
        else:
            return gcd(x,y%x)
def gcd2(x4):
    if len(x4)>2:
        return gcd2([gcd(x4[0],x4[1]),]+x4[2:])
    elif len(x4) ==2:
        return gcd(x4[0],x4[1])
    else:
        return x4[0]
N, X = map(int,input().split())
x=[int(i) for i in input().split()]
x.append(X)
x3=[]
for i in range(len(x)-1):
    x3.append(abs(x[i+1]-x[i]))
print(gcd2(x3))


Fixed submission:
H, W = map(int,input().split())
a=[]
N2=0
for i in range(H):
    b=[int(i) for i in input().split()]
    for j in range(W):
        if b[j]%2==1:
            N2+=1
    a.append(b)
if N2%2==1:
    N2-=1
N=0
N3=0
idou=1
if W==1:
    idou=2
c=0
i=0
j=0
s=[]
for k in range(H*W):
    if N3==N2:
        break
    if idou==1:
        if a[i][j]%2==1:
            N+=1
            s.append(str(i+1)+" "+str(j+1)+" "+str(i+1)+" "+str(j+2))
            a[i][j+1]+=1
            a[i][j]-=1
            if a[i][j+1]%2==0:
                N3+=2
        j+=1
        if j==W-1-c:
            idou=2
    elif idou==2:
        if a[i][j]%2==1:
            N+=1
            s.append(str(i+1)+" "+str(j+1)+" "+str(i+2)+" "+str(j+1))
            a[i+1][j]+=1
            a[i][j]-=1
            if a[i+1][j]%2==0:
                N3+=2
        i+=1
        if i==H-1-c:
            idou=3
    elif idou==3:
        if a[i][j]%2==1:
            N+=1
            s.append(str(i+1)+" "+str(j+1)+" "+str(i+1)+" "+str(j))
            a[i][j-1]+=1
            a[i][j]-=1
            if a[i][j-1]%2==0:
                N3+=2
        j-=1
        if j==c:
            idou=4
    elif idou==4:
        if a[i][j]%2==1:
            N+=1
            s.append(str(i+1)+" "+str(j+1)+" "+str(i)+" "+str(j+1))
            a[i-1][j]+=1
            a[i][j]-=1
            if a[i-1][j]%2==0:
                N3+=2
        i-=1
        if i==c+1:
            idou=1
            c+=1
print(N)
for i in range(N):
    print(s[i])
Buggy python submission (verdict: Time Limit Exceeded):
N, M, Q = map(int,input().split())
m =  [[0 for y in range(N+1)] for x in range(N+1)]
m2 =  [[0 for y in range(N+1)] for x in range(N+1)]

for i in range(M):
    l, r = map(int,input().split())
    m[l][r]+=1

for i in range(1,N+1):
    s=m[i][i]
    m2[i][i]=s
    for j in range(i+1,N+1):
        for k in range(i,j+1):
            s+=m[k][j]
        m2[i][j]=s


for i in range(1,Q+1):
    l, r = map(int,input().split())
    print(m2[l][r])


Fixed submission:
N, M, Q = map(int,input().split())
m =  [[0 for y in range(N+1)] for x in range(N+1)]
m2 =  [[0 for y in range(N+1)] for x in range(N+1)]
m3 =[[0 for y in range(N+1)] for x in range(N+1)]

for i in range(M):
    l, r = map(int,input().split())
    m[l][r]+=1

for j in range(1, N+1):
    s=0
    for i in range(1, N+1):
        s+=m[i][j]
        m2[i][j]=s

for i in range(1, N+1):
    s=0
    for j in range(i, N+1):
        s+=m2[j][j]-m2[i-1][j]
        m3[i][j]=s

for i in range(1,Q+1):
    l, r = map(int,input().split())
    print(m3[l][r])

Buggy python submission (verdict: Time Limit Exceeded):
N, M, Q = map(int,input().split())
m =  [[0 for y in range(N+1)] for x in range(N+1)]

for i in range(M):
    l, r = map(int,input().split())
    for j in range(0, l+1):
        for k in range(r,N+1):
            m[j][k]+=1

for i in range(1,Q+1):
    l, r = map(int,input().split())
    print(m[l][r])


Fixed submission:
N, M, Q = map(int,input().split())
m =  [[0 for y in range(N+1)] for x in range(N+1)]
m2 =  [[0 for y in range(N+1)] for x in range(N+1)]
m3 =[[0 for y in range(N+1)] for x in range(N+1)]

for i in range(M):
    l, r = map(int,input().split())
    m[l][r]+=1

for j in range(1, N+1):
    s=0
    for i in range(1, N+1):
        s+=m[i][j]
        m2[i][j]=s

for i in range(1, N+1):
    s=0
    for j in range(i, N+1):
        s+=m2[j][j]-m2[i-1][j]
        m3[i][j]=s

for i in range(1,Q+1):
    l, r = map(int,input().split())
    print(m3[l][r])

Buggy python submission (verdict: Time Limit Exceeded):
N, M, Q = map(int,input().split())
p=[0,]
q=[0,]
m =  [[0 for y in range(N+1)] for x in range(N+1)]

for i in range(M):
    l, r = map(int,input().split())
    for j in range(0, l+1):
        for k in range(r,N+1):
            m[j][k]+=1

for i in range(Q):
    l, r = map(int,input().split())
    p.append(l)
    q.append(r)

for i in range(1,Q+1):
    print(m[p[i]][q[i]])


Fixed submission:
N, M, Q = map(int,input().split())
m =  [[0 for y in range(N+1)] for x in range(N+1)]
m2 =  [[0 for y in range(N+1)] for x in range(N+1)]
m3 =[[0 for y in range(N+1)] for x in range(N+1)]

for i in range(M):
    l, r = map(int,input().split())
    m[l][r]+=1

for j in range(1, N+1):
    s=0
    for i in range(1, N+1):
        s+=m[i][j]
        m2[i][j]=s

for i in range(1, N+1):
    s=0
    for j in range(i, N+1):
        s+=m2[j][j]-m2[i-1][j]
        m3[i][j]=s

for i in range(1,Q+1):
    l, r = map(int,input().split())
    print(m3[l][r])
Buggy python submission (verdict: Runtime Error):
N,T = map(int,input().split())

best=-1
best_c=-1
for _ in range(N):
    c,t = map(int,input().split())
    if t <= T:
        if best_c == -1:
            best_c = c
        else if best_c > c:
            best_c = c
if best == -1:
    print("TLE")
else: 
    print(best)

Fixed submission:
N,T = map(int,input().split())

best=-1
best_c=-1
for _ in range(N):
    c,t = map(int,input().split())
    if t <= T:
        if best_c == -1:
            best_c = c
        elif best_c > c:
            best_c = c
if best_c == -1:
    print("TLE")
else: 
    print(best_c)
Buggy python submission (verdict: Runtime Error):
n, T = map(int, input().split())
a = set()
min_ = 1001
for i in range(n):
    c, t = map(int, input().split())
    a.add(c)
    if t <= T and c <= min_:
        min_ = c
    a.remove(c)
if min_ == 1001:
    print('TLE')
else:
    print(min_)

Fixed submission:
n = int(input())
if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a + b)

Buggy python submission (verdict: Runtime Error):
n, T = map(int, input().split())
a = set()
min_ = 1000
for i in range(n):
    c, t = map(int, input().split())
    a.add(c)
    if t <= T and a[i] <= min_:
        min_ = a[i]
    a.remove(c)
if min_ == 1000:
    print('TLE')
else:
    print(min_)

Fixed submission:
n = int(input())
if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a + b)

Buggy python submission (verdict: Runtime Error):
n, T = map(int, input().split())
a = []
min_ = 1001
for i in range(n):
    c, t = map(int, input().split())
    a.append(c)
    if t <= T and a[i] <= min_:
        min_ = a[i]
if min_ == 1001:
    print('TLE')
else:
    print(min_)

Fixed submission:
n = int(input())
if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a + b)

Buggy python submission (verdict: Runtime Error):
N,T=map(int, input().split())
ct=[]
Nminimum=int(101)
output=str('TLE')
for i in range(N):
    ct.append(list(map(int, input().split())))
for i in range(N):
    if ct[i][1]<=T:
        if ct[i][0]<Nminimum:
            Nminimum=ct[i][0]
            output=Nminimum
print(output)

Fixed submission:
N=int(input())
if N==1:
    output=str('Hello World')
else:
    A=int(input())
    B=int(input())
    output=A+B
print(output)
Buggy python submission (verdict: Runtime Error):
N=int(input())
a=list(map(int, input().rstrip().split()))
work=int()
Multiple=int(1)
Output=int(0)
def gcd(x,y):
    while y>0:
        x, y=y, x%y
    return x
for i in range(N):
    Multiple=int((Multiple*a[i])/gcd(Multiple, a[i]))
for i in range(N):
    Output+=(Multiple-1)%a[i]
print(Output)


Fixed submission:
N=int(input())
a=list(map(int, input().rstrip().split()))
work=int()
Multiple=int(1)
Output=int(0)
def gcd(x,y):
    while y>0:
        x, y=y, x%y
    return x
for i in range(N):
    Multiple=int((Multiple*a[i])//gcd(Multiple, a[i]))
for i in range(N):
    Output+=(Multiple-1)%a[i]
print(Output)