Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
A = list(map(int, input().split()))
L = len(A)
ans = [0, 0, 0, 0]
dx = A[2] - A[0]
dy = A[3] - A[1]
if(dx>0 and dy>=0):
    dx = abs(dx)
    dy = abs(dy)
    x3 = A[2] - dy
    y3 = A[3] + dx
    x4 = x3 - dx
    y4 = y3 - dy
elif(dx>=0 and dy<0):
    dx = abs(dx)
    dy = abs(dy)
    x3 = A[2] + dy
    y3 = A[3] + dx
    x4 = x3 - dx
    y4 = y3 + dy
elif(dx<=0 and dy<0):
    dx = abs(dx)
    dy = abs(dy)
    x3 = A[2] + dy
    y3 = A[3] - dx
    x4 = x3 + dx
    y4 = y3 + dy
elif(dx<0 and dy>=0):
    dx = abs(dx)
    dy = abs(dy)
    x3 = A[2] - dy
    y3 = A[3] - dx
    x4 = x3 + dx
    y4 = y3 - dy

ans[0] = str(x3)
ans[1] = str(y3)
ans[2] = str(x4)
ans[3] = str(y4)
ans = ' '.join(ans)
print(ans)

Fixed submission:
A = list(map(int, input().split()))
L = len(A)
ans = [0, 0, 0, 0]
dx = A[2] - A[0]
dy = A[3] - A[1]
if(dx>=0 and dy>=0):
    dx = abs(dx)
    dy = abs(dy)
    x3 = A[2] - dy
    y3 = A[3] + dx
    x4 = x3 - dx
    y4 = y3 - dy
elif(dx>0 and dy<0):
    dx = abs(dx)
    dy = abs(dy)
    x3 = A[2] + dy
    y3 = A[3] + dx
    x4 = x3 - dx
    y4 = y3 + dy
elif(dx<=0 and dy<=0):
    dx = abs(dx)
    dy = abs(dy)
    x3 = A[2] + dy
    y3 = A[3] - dx
    x4 = x3 + dx
    y4 = y3 + dy
elif(dx<0 and dy>0):
    dx = abs(dx)
    dy = abs(dy)
    x3 = A[2] - dy
    y3 = A[3] - dx
    x4 = x3 + dx
    y4 = y3 - dy

ans[0] = str(x3)
ans[1] = str(y3)
ans[2] = str(x4)
ans[3] = str(y4)
ans = ' '.join(ans)
print(ans)
Buggy python submission (verdict: Runtime Error):
import sys
H_W = list(map(int,input().split()))
H = H_W[0]
W = H_W[1]
b = [[0 for i in range(W)] for j in range(H)]
a = [[str(c) for c in l.strip()] for l in sys.stdin]

# .を0に, #を1にした新しい配列bを作る
for i in range(H):
    for j in range(W):
        if a[i][j] == '#':
            b[i][j] = 1

# 列と行ごとにすべて0のものを探す
w = [0] * W
h = [0] * H
for i in range(H):
    for j in range(W):
        h[i] = h[i] + b[i][j]
        w[j] = w[j] + b[i][j]

# 全ての要素が0の列と行を削除する
for i in range(H):
    if h[i] == 0:
        del a[i]
        H = H -1
    if w[i] == 0:
        for j in range(H):
            del a[j][i]
        W = W - 1
# 答え
for i in range(H):
    flag = 0
    for j in range(W):
        if flag == 0:
            ans = a[i][j]
            flag = 1
        else:
            ans = ans + a[i][j]
    print(ans)
    

Fixed submission:
import sys
H_W = list(map(int,input().split()))
H = H_W[0]
W = H_W[1]
b = [[0 for i in range(W)] for j in range(H)]
a = [[str(c) for c in l.strip()] for l in sys.stdin]

# .を0に, #を1にした新しい配列bを作る
for i in range(H):
    for j in range(W):
        if a[i][j] == '#':
            b[i][j] = 1

# 列と行ごとにすべて0のものを探す
w = [0] * W
h = [0] * H
for i in range(H):
    for j in range(W):
        h[i] = h[i] + b[i][j]
        w[j] = w[j] + b[i][j]

#print(h)
#print(w)
# 全ての要素が0の列と行を削除する
i = 0
c = 0
j = 0
for i in range(H):
    if h[i] == 0:
        del a[j]
        H = H - 1
        j = j - 1
    j = j + 1
#print(a)

k = 0
for i in range(W):
    if w[i] == 0:
        for j in range(H):
            del a[j][k]
        W = W - 1
        k = k - 1
    k = k + 1
#print(a)
# 答え
for i in range(H):
    flag = 0
    for j in range(W):
        if flag == 0:
            ans = a[i][j]
            flag = 1
        else:
            ans = ans + a[i][j]
    print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
K = int(input())
n = N 
ans = 0
c = 0
co
while n > 10: #桁数を数える
    c = c + 1 
    n = n // 10
while c > 0: 
    m = N // (10 * c)
    d = m % 10
    if d == 1:
        co = co + 1
    else:
        ans = d
        break
    c = c - i
if K < co:
    ans = n
print(ans)

Fixed submission:
N = int(input())
K = int(input())
n = N 
ans = n
c = 0
co = 0

while n > 10: #桁数を数える
    c = c + 1 
    n = n // 10
#print(c)
while c > -1: #上の桁から見ていく
    m = N // (10 ** c)
    d = m % 10
    #print(m)
    #print(d)
    if d == 1: # 1がどこまで連続しているかを調べる
        co = co + 1
    else:      #初めて1以外の数がでてきたらそれを一旦答えとする
        ans = d 
        break
    c = c - 1
if K <= co: #1が連続しているところを答える場合は答えは1
        ans = 1

print(ans)
Buggy python submission (verdict: Runtime Error):
A = list(input())
L = len(A)

ans = 'WA'
flag = 0
f = 0
count = 0
if A[0] == 'A':
    flag = flag + 1

for i in range(2,L-1):
    if A[i] == 'C':
        count = count + 1
        if f == 0:
            j = i
            f = 1
if count == 1:
    flag = flag + 1

count = 0
for i in range(1,L-1):
    if A[i].isupper():
        conut = count + 1
        if i == j:
            count = count - 1
if count == 0:
    flag = flag + 1

if flag == 3:
    ans = 'AC'

print(ans)

Fixed submission:
A = list(input())
L = len(A)

ans = 'WA'
flag = 0
f = 0
j = 0

if A[0] == 'A':
    if A[0].isupper():
        flag = flag + 1
#print(flag)
count = 0
i=2
while(1):
    if A[i] == 'C':
        if A[i].isupper():
            count = count + 1
    i = i + 1
    if (L-2-i < 0):
        break
#print(count)
if count == 1:
    flag = flag + 1
#print(flag)
count = 0
for i in range(1,L):
    #print(A[i].isupper())
    if A[i].isupper():
        count = count + 1
#print(count)
if count == 1:
    flag = flag + 1
#print(flag)
if flag == 3:
    ans = 'AC'

print(ans)

Buggy python submission (verdict: Runtime Error):
 = list(input())
L = len(A)

ans = 'WA'
flag = 0
f = 0
count = 0
if A[0] == 'A':
    flag = flag + 1

for i in range(2,L-1):
    if A[i] == 'C':
        count = count + 1
        if f == 0:
            j = i
            f = 1
if count == 1:
    flag = flag + 1

count = 0
for i in range(1,L-1):
    if A[i].islower():
        conut = count + 1
        if i == j:
            count = count - 1
if count == 0:
    flag = flag + 1

if flag == 3:
    ans = 'AC'
    
print(ans)

Fixed submission:
A = list(input())
L = len(A)

ans = 'WA'
flag = 0
f = 0
j = 0

if A[0] == 'A':
    if A[0].isupper():
        flag = flag + 1
#print(flag)
count = 0
i=2
while(1):
    if A[i] == 'C':
        if A[i].isupper():
            count = count + 1
    i = i + 1
    if (L-2-i < 0):
        break
#print(count)
if count == 1:
    flag = flag + 1
#print(flag)
count = 0
for i in range(1,L):
    #print(A[i].isupper())
    if A[i].isupper():
        count = count + 1
#print(count)
if count == 1:
    flag = flag + 1
#print(flag)
if flag == 3:
    ans = 'AC'

print(ans)
Buggy python submission (verdict: Runtime Error):
a = int(input())
ans = 0
if a % 2 == 0:
    ans = a
elif a[i] == "-":
    ans = a * 2

print(ans)



Fixed submission:
a = int(input())
ans = 0
if a % 2 == 0:
    ans = a
else:
    ans = a * 2

print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input()
A = A.split()
L = len(A)
B =[]
for i in range(L):
    B.append(int(a[i]))
B.sort(reverse=True)
ans = B[0] - B[L-1]

print(ans)


Fixed submission:
N = int(input())
A = input()
A = A.split()
L = len(A)
B =[]
for i in range(L):
    B.append(int(A[i]))
B.sort(reverse=True)
ans = B[0] - B[L-1]

print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input()
A = A.split()
B =[]
C = []
ans = 0
for i in range(N):
    B.append(int(A[i]))
    C.append(int(A[i]))
C.sort(reverse=True)
"""
Max = C[0]
b = Max - N
"""
b = C[N/2]
for i in range(N):
    ans = ans + abs(B[i]-(i+b+1))

ans = ans
print(ans)


Fixed submission:
import math
N = int(input())
A = input()
A = A.split()
B =[]
C = []
ans1 = 0
ans2 = 0
for i in range(N):
    B.append(int(A[i]))
    C.append(int(A[i])-i)
C.sort(reverse=True)

n = math.floor(N/2)
b = C[n]
b1 = C[n-1]

for i in range(N):
    ans1 = ans1 + abs(B[i]-(i+b))
for i in range(N):
    ans2 = ans2 + abs(B[i]-(i+b1))
ans = min(ans1, ans2)
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input()
A = A.split()
B =[]
C = []
ans1 = 0
ans2 = 0
for i in range(N):
    B.append(int(A[i]))
    C.append(int(A[i]))
C.sort(reverse=True)
Max = C[0]
b = Max - N
for i in range(N):
    ans1 = ans + abs(B[i]-(i+b+1))
for i in range(N):
    ans2 = ans + abs(B[i]-(i+1))
if ans1>ans2:
    ans = ans1
else:
    ans = ans2

print(ans)

Fixed submission:
import math
N = int(input())
A = input()
A = A.split()
B =[]
C = []
ans1 = 0
ans2 = 0
for i in range(N):
    B.append(int(A[i]))
    C.append(int(A[i])-i)
C.sort(reverse=True)

n = math.floor(N/2)
b = C[n]
b1 = C[n-1]

for i in range(N):
    ans1 = ans1 + abs(B[i]-(i+b))
for i in range(N):
    ans2 = ans2 + abs(B[i]-(i+b1))
ans = min(ans1, ans2)
print(ans)
Buggy python submission (verdict: Runtime Error):
a = input()
a = a.split()
D = int(a[0])
N = int(a[1])
ans = (100 ** D) * N
if N = 100:
    ans = ans + (100 ** D)
print(ans)


Fixed submission:
a = input()
a = a.split()
D = int(a[0])
N = int(a[1])
ans = (100 ** D) * N
if N == 100:
    ans = ans + (100 ** D)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
total = 0
for i in range (N):
  for j in range(N):
    total += A[i]*A[j]
for k in range(N):
  total -= A[k]*A[k]
total = total/2
print(int(total%(10**9+7)))

Fixed submission:
n=int(input())
A=list(map(int,input().split()))
a=sum(A)
a=a**2
b=0

for j in range(n):
  b+=A[j]**2
if a-b<0:
  c=a-b
  while c<=0:
    c+=mod
  
  ans=c//2
  ans=ans%(10**9+7)
 
else:
  ans=(a-b)//2
  ans=ans%(10**9+7)
 
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))
total = 0
for i in range (N):
  for j in range(N):
    total += A[i]*A[j]
for k in range(N):
  total -= A[k]*A[k]
total = total/2
print(int(total%(10**9+7)))

Fixed submission:
n=int(input())
A=list(map(int,input().split()))
a=sum(A)
a=a**2
b=0

for j in range(n):
  b+=A[j]**2
if a-b<0:
  c=a-b
  while c<=0:
    c+=mod
  
  ans=c//2
  ans=ans%(10**9+7)
 
else:
  ans=(a-b)//2
  ans=ans%(10**9+7)
 
print(ans)
Buggy python submission (verdict: Runtime Error):
x,k,d= map(int,input().split())
x=abs(x)
if x>d*k:
  print(x-d*k)
else:
  m=x//d
  k=(k-m)%2
  print(abs((x%d)-k*d))

Fixed submission:
s=list(input())
count=0

if 'R' in s:
  count+=1
for i in range(len(s)-1):
  if s[i]==s[i+1] and s[i]=='R':
    count+=1
print(count)

Buggy python submission (verdict: Runtime Error):
x,k,d= map(int,input().split())
s=[]
x=abs(x)
if x>d*k:
  print(x-d*k)
else:
  for i in range(k):
    s.append(abs(x-d*i))
    s.sort()
  print(s[0])

Fixed submission:
s=list(input())
count=0

if 'R' in s:
  count+=1
for i in range(len(s)-1):
  if s[i]==s[i+1] and s[i]=='R':
    count+=1
print(count)
Buggy python submission (verdict: Runtime Error):
n=int(input())
INF=float('inf')

h=[]
for _ in range(n):
  a,b,c=map(int,input().split())
  h.append([a,b,c])

dp=[[0 for i in range(3)]for j in range(n+1)]
for i in range(1,n+1):
  dp[i][0]=max(dp[i-1][1]+h[i-1][0],dp[i-1][2]+h[i-1[0]])
  dp[i][1]=max(dp[i-1][0]+h[i-1][1],dp[i-1][2]+h[i-1[1]])
  dp[i][2]=max(dp[i-1][0]+h[i-1][2],dp[i-1][1]+h[i-1[2]])

print(max(dp[n][0],dp[n][1],dp[n][2]))

Fixed submission:
n=int(input())
INF=float('inf')

h=[]
for _ in range(n):
  a,b,c=map(int,input().split())
  h.append([a,b,c])

dp=[[0 for i in range(3)]for j in range(n+1)]
for i in range(1,n+1):
  dp[i][0]=max(dp[i-1][1]+h[i-1][0],dp[i-1][2]+h[i-1][0])
  dp[i][1]=max(dp[i-1][0]+h[i-1][1],dp[i-1][2]+h[i-1][1])
  dp[i][2]=max(dp[i-1][0]+h[i-1][2],dp[i-1][1]+h[i-1][2])

print(max(dp[n][0],dp[n][1],dp[n][2]))

Buggy python submission (verdict: Runtime Error):
n=int(input())
INF=float('inf')

h=[]
for _ in range(n):
  a,b,c=map(int,input().split())
  h.append(a,b,c)

dp=[[0 for i in range(3)]for j in range(n+1)]
for i in range(1,n+1):
  dp[i][0]=max(dp[i-1][1]+h[i-1][0],dp[i-1][2]+h[i-1[0]])
  dp[i][1]=max(dp[i-1][0]+h[i-1][1],dp[i-1][2]+h[i-1[1]])
  dp[i][2]=max(dp[i-1][0]+h[i-1][2],dp[i-1][1]+h[i-1[2]])

print(max(dp[n][0],dp[n][1],dp[n][2]))

Fixed submission:
n=int(input())
INF=float('inf')

h=[]
for _ in range(n):
  a,b,c=map(int,input().split())
  h.append([a,b,c])

dp=[[0 for i in range(3)]for j in range(n+1)]
for i in range(1,n+1):
  dp[i][0]=max(dp[i-1][1]+h[i-1][0],dp[i-1][2]+h[i-1][0])
  dp[i][1]=max(dp[i-1][0]+h[i-1][1],dp[i-1][2]+h[i-1][1])
  dp[i][2]=max(dp[i-1][0]+h[i-1][2],dp[i-1][1]+h[i-1][2])

print(max(dp[n][0],dp[n][1],dp[n][2]))
Buggy python submission (verdict: Runtime Error):
x = int(input())
if x = 1:
  print("0")
if x = 0:
  print("1")

Fixed submission:
x = input()
x = int(x)
if x == 1:
    print("0")
else:
    print("1")
Buggy python submission (verdict: Runtime Error):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = input()

move_a = int(v) * int(t) + int(a)
move_b = int(w) * int(t) + int(b)

if move_a >= move_b:
    print("YES")
else:
    print("NO")


Fixed submission:
s = input()
print(s[0] + s[1] + s[2])

Buggy python submission (verdict: Runtime Error):
# coding:utf-8
a,v = map(int,input().split())
b,w = map(int,input().split())
t = input()
 
move_a = int(v) * int(t) + int(a)
move_b = int(w) * int(t) + int(b)
 
if move_a >= move_b:
    print("YES")
else:
    print("NO")

Fixed submission:
s = input()
print(s[0] + s[1] + s[2])

Buggy python submission (verdict: Runtime Error):
a,v = map(int,input().split())
b,w = map(int,input().split())
t = input()

move_a = int(v) * int(t) + int(a)
move_b = int(w) * int(t) + int(b)

if move_a >= move_b:
    print("YES")
else:
    print("NO")


Fixed submission:
s = input()
print(s[0] + s[1] + s[2])

Buggy python submission (verdict: Runtime Error):
a,v = input().split()
b,w = input().split()
t = input()
 
move_a = int(v) * int(t) + int(a)
move_b = int(w) * int(t) + int(b)
 
if move_a >= move_b:
    print("YES")
else:
    print("NO")

Fixed submission:
s = input()
print(s[0] + s[1] + s[2])

Buggy python submission (verdict: Runtime Error):
# coding:utf-8
a,v = input().split()
b,w = input().split()
t = input()

move_a = int(v) * int(t) + int(a)
move_b = int(w) * int(t) + int(b)

if move_a >= move_b:
    print("YES")
else:
    print("NO")

Fixed submission:
s = input()
print(s[0] + s[1] + s[2])
Buggy python submission (verdict: Runtime Error):
n = input()
answer = 1
for i in range(int(n)):
    a = int(input())
    answer = answer * a
    if answer > 10**18:
        print("-1")
        break
print(answer)

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

Buggy python submission (verdict: Runtime Error):
n = input()
answer = 1
for i in range(int(n)):
    a = int(input())
    answer = answer * a
    if answer > 10**18:
        print("-1")
    else:
        print(answer)

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

Buggy python submission (verdict: Runtime Error):
import math
import numpy as np

n = input()
answer = 1
for i in range(int(n)):
    a = int(input())
    answer = answer * a
    if answer > 10**18:
        print("-1")
    else:
        print(answer)

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

Buggy python submission (verdict: Runtime Error):
n = input()
for i in range(n-1):
    a = raw_input().split()
    n *= 1
    print(n)

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

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())

print(a * b)

Fixed submission:
a,b = input().split()
print(int(a) * int(b))
Buggy python submission (verdict: Runtime Error):
S = int(input())
W = int(input())
if W >= S:
    print('unsafe')
else:
    print('safe')

Fixed submission:
S,W = input().split()
if int(W) >= int(S):
    print('unsafe')
else:
    print('safe')

Buggy python submission (verdict: Runtime Error):
S =  int(input('How many sheep'))
W =  int(input('How many wolf'))
if W >= S:
    print('unsafe')
else:
    print('safe')

Fixed submission:
S,W = input().split()
if int(W) >= int(S):
    print('unsafe')
else:
    print('safe')
Buggy python submission (verdict: Runtime Error):
# cook your dish here
s = input()
c = 0 
if(s[0]==s[1] and s[2]==s[3]):
    c=1 
elif(s[0]==s[2] and s[1]==a[3]):
    c=1 
elif(s[0]==s[3] and s[1]==s[2]):
    c=1 
if(c==1):
    print("Yes")
else:
    print("No")

Fixed submission:
# cook your dish here
s = input()
a=[0,0,0,0]
b=[1,1,1,1]
for i in range(4):
    for j in range(4):
        if(s[i]==s[j] and i != j):
            a[i]+=1 
if(a==b):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
# coding=utf-8

if __name__ == '__main__':
    N = int(input())
    li_A = list(map(int, input().split()))

    ans = li_A[0]

    for i in range(1,N):
        if (ans * li_A[i]) <= 1000000000000000000:
            ans = ans * li_A[i]

        else:
            ans = -1

    print(ans)

Fixed submission:
# coding=utf-8
import sys

if __name__ == '__main__':
    N = int(input())
    li_A = list(map(int, input().split()))

    ans = li_A[0]

    if 0 in li_A:
        print('0')
        sys.exit()

    for i in range(1, N):
        if ans * li_A[i] > 1000000000000000000:
            print('-1')
            sys.exit()
        else:
            ans *= li_A[i]

    print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())

c = N % 9
if(c==0):
  print("Yes")
else:
  print("No")
        
     

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

count = 0
while(N>0):
  N = N - X
  count += 1
  
print(T*count)
Buggy python submission (verdict: Runtime Error):
import itertools

X,K,D = map(int,input().split())
L = [D,-D]

for comb in itertools.combinations_with_replacement(L, K):
  x = X
  for d in comb:
    x = x + d
    if(i == 0):
      x_min = x
    if(abs(x) < abs(x_min)):
      x_min = x

print(abs(x_min))
    
    


Fixed submission:
a,b,c = map(str,input().rstrip(""))


if(a=="R" and b == "R" and c == "R"):
  count = 3
  
elif(a=="R" and b == "R" and c == "S"):
  count = 2
elif(a=="R" and b == "S" and c == "S"):
  count = 1
elif(a=="S" and b == "R" and c == "R"):
  count = 2
elif(a=="S" and b == "R" and c == "S"):
  count = 1
elif(a=="S" and b == "S" and c == "R"):
  count = 1
elif(a=="R" and b == "S" and c == "R"):
  count = 1
else:
  count = 0

print(count)

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

X,K,D = map(int,input().split())
L = [D,-D]
comb = list(itertools.combinations_with_replacement(L, K))

for i in range(len(comb)):
  x = X
  for d in comb[i]:
    x = x + d
    if(i == 0):
      x_min = x
    if(abs(x) < abs(x_min)):
      x_min = x

print(abs(x_min))
    
    


Fixed submission:
a,b,c = map(str,input().rstrip(""))


if(a=="R" and b == "R" and c == "R"):
  count = 3
  
elif(a=="R" and b == "R" and c == "S"):
  count = 2
elif(a=="R" and b == "S" and c == "S"):
  count = 1
elif(a=="S" and b == "R" and c == "R"):
  count = 2
elif(a=="S" and b == "R" and c == "S"):
  count = 1
elif(a=="S" and b == "S" and c == "R"):
  count = 1
elif(a=="R" and b == "S" and c == "R"):
  count = 1
else:
  count = 0

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

#N行,距離D
N,D = map(int, input().split())

num_list = []
for i in range(N):
    num_list.append(list(map(int,input().split())))

count = 0
for p,q in num_list:
  d = math.sqrt(p**2 + q**2)
  if(d<=D):
    count += 1
    
print(count)

Fixed submission:
N = int(input().strip())
if(N >= 30):
  print("Yes")
elif(N<30):
  print("No")
Buggy python submission (verdict: Runtime Error):
S=int(input("Sを入力してください"))
T=int(input("Tを入力してください"))

v='a' or 'b' or 'c' or 'd' or 'e' or 'f' or 'g' or 'i' or 'j' or 'k' or 'l' or 'm' or 'n' or 'o' or 'p' or 'q' or 'r' or 's' or 't' or 'u' or 'v' or 'w' or 'x' or 'y' or 'z'

if S =((v + v + v + v + v + v + v + v + v + v) or (v + v + v + v + v + v + v + v + v) or (v + v + v + v + v + v + v + v ) or (v + v + v + v + v + v + v ) or (v + v + v + v + v + v )or (v + v + v + v + v ) or (v + v + v + v )  or (v + v + v )  or (v + v )  or (v )  
       pass
if S =( T + v ):
  print("YES")
else:
  print("No")

Fixed submission:
S=input()
T=input()

lenS=len(S)
T2=T[0:lenS]

if S == T2:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
S=input()

if S = "ABC":
  print("ARC")
else:
  print("ABC")
  


Fixed submission:
S=input()

if S == "ABC":
  print("ARC")
else:
  print("ABC")
Buggy python submission (verdict: Runtime Error):
K=int(input())
A,B=map(int,input().split())

for i in range(A,B,1):
    if (i %= K) == 0:
        print("OK")
        break
print("NG")


Fixed submission:
K=int(input())
A,B=map(int,input().split())

yn=0
for i in range(A,B+1,1):
    if (i % K) == 0:
        print("OK")
        yn=1
        break
if yn==0:
    print("NG")

Buggy python submission (verdict: Runtime Error):
K=input()
A=input()
B=input()

for i in range(A,B,1):
    if (i %= K) == 0:
        print("OK")
    else:
        print("NG")


Fixed submission:
K=int(input())
A,B=map(int,input().split())

yn=0
for i in range(A,B+1,1):
    if (i % K) == 0:
        print("OK")
        yn=1
        break
if yn==0:
    print("NG")

Buggy python submission (verdict: Runtime Error):
K=input()
A=input()
B=input()

for i in range(A,B,1):
  if (i %= K) == 0:
    print("OK")


Fixed submission:
K=int(input())
A,B=map(int,input().split())

yn=0
for i in range(A,B+1,1):
    if (i % K) == 0:
        print("OK")
        yn=1
        break
if yn==0:
    print("NG")

Buggy python submission (verdict: Runtime Error):
K=input()
A=input()
B=input()

for i in range(A,B):
  if (i %= K) ==0:
    print("OK")


Fixed submission:
K=int(input())
A,B=map(int,input().split())

yn=0
for i in range(A,B+1,1):
    if (i % K) == 0:
        print("OK")
        yn=1
        break
if yn==0:
    print("NG")

Buggy python submission (verdict: Runtime Error):
K=input()
A=input()
B=input()

i %= K
for i in range(A,B): 
  if i==0:
    print("OK")


Fixed submission:
K=int(input())
A,B=map(int,input().split())

yn=0
for i in range(A,B+1,1):
    if (i % K) == 0:
        print("OK")
        yn=1
        break
if yn==0:
    print("NG")

Buggy python submission (verdict: Runtime Error):
K=input()
A=input()
B=input()

for i in range(A,B):
  i %= K
  if i==0:
    print("OK")


Fixed submission:
K=int(input())
A,B=map(int,input().split())

yn=0
for i in range(A,B+1,1):
    if (i % K) == 0:
        print("OK")
        yn=1
        break
if yn==0:
    print("NG")

Buggy python submission (verdict: Runtime Error):
K=input()
A=input()
B=input()

for i in range(A,B)
i %= K
if i==0:
  print("OK")

Fixed submission:
K=int(input())
A,B=map(int,input().split())

yn=0
for i in range(A,B+1,1):
    if (i % K) == 0:
        print("OK")
        yn=1
        break
if yn==0:
    print("NG")
Buggy python submission (verdict: Runtime Error):
R=int(input())
pai=3.14
    print(R*2*pai)

Fixed submission:
R=int(input())
pai=3.14
print(R*2*pai)

Buggy python submission (verdict: Runtime Error):
R=int(input())
pai=float(3.14)
    print(float(R*2*pai))

Fixed submission:
R=int(input())
pai=3.14
print(R*2*pai)

Buggy python submission (verdict: Runtime Error):
R=int(input())
    print(float(R*2*3.141))

Fixed submission:
R=int(input())
pai=3.14
print(R*2*pai)

Buggy python submission (verdict: Runtime Error):
R=int(input())
    print(R*2*3.141)

Fixed submission:
R=int(input())
pai=3.14
print(R*2*pai)

Buggy python submission (verdict: Runtime Error):
R=int(input())
    print(R*3.141)


Fixed submission:
R=int(input())
pai=3.14
print(R*2*pai)

Buggy python submission (verdict: Runtime Error):
R=int(input())
pai=float(3.141)
    print(R*pai)


Fixed submission:
R=int(input())
pai=3.14
print(R*2*pai)

Buggy python submission (verdict: Runtime Error):
R=int(input())
    print(R*2*3.141)

Fixed submission:
R=int(input())
pai=3.14
print(R*2*pai)