Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p02600 (python)

Fixed submission:
s=int(input())
if 400<=s<=599:
    print('8')
elif 600<=s<=799:
    print('7')
elif 800<=s<=999:
    print('6')
elif 1000<=s<=1199:
    print('5')
elif 1200<=s<=1399:
    print('4')
elif 1400<=s<=1599:
    print('3')
elif 1600<=s<=1799:
    print('2')
elif 1800<=s<=1999:
    print('1')

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
k=int(input())
for i in range(k+1):
    if a>b:
        b=b*2
    else:
        if b>c:
            c=c*2
        else:
            break

if a<b<c:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
k=int(input())
for i in range(k):
    if a>b:
        b=b*2
        if b>c:
            c=c*2


if a<b and b<c:
    print('Yes')
else:
    print('No')
Problem p02601 (python)

Fixed submission:
a,b,c=map(int,input().split())
k=int(input())
for i in range(k):
    if a>=b:
        b=b*2
    else:
        if b>=c:
            c=c*2
        else:
            break

if a<b<c:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
k=int(input())
for i in range(k):
    if a>b:
        b=b*2
    else:
        if b>c:
            c=c*2
        else:

if a<b and b<c:
    print('Yes')
else:
    print('No')
Problem p02612 (python)

Fixed submission:
N=int(input())
if N%1000==0:
    print(0)
else:
    print(1000-N%1000)

Buggy submission (verdict: Runtime Error):
N = int(input())
s = [input() for i in range(N)]
for v in ['AC', 'WA', 'TLE', 'RE']:
    print('{0} x {1}'.format(v, s.count(v)))
Problem p02612 (python)

Fixed submission:
N = int(input())
s = 0
for i in range(11):
  if s >= N:
    ans = s - N
    break
  else:
    s += 1000
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
s = 0
for i in range(10):
  if s >= N:
    ans = s - N
    break
  else:
    s += 1000
print(ans)
Problem p02657 (python)

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

print(a[0]*a[1])

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
print(a*b)
Problem p02658 (python)

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

def main():
  if 0 in A:
    print(0)
    return
 
  count = 1
  for i in A:
    count *= i
    if count > 1000000000000000000:
      print(-1)
      return
 
  print(count)

main()

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))

if 0 in A:
  print(0)
  return

count = 1
for i in A:
  count *= i
  if count > 10000000000000000000:
    print(-1)
    return

print(count)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))

if 0 in A:
  print(0)
  return

count = 1
for i in A:
  count *= a
  if count > 10000000000000000000:
    print(-1)
    return

print(count)
Problem p02664 (python)

Fixed submission:
s = list(input())
for index, i in enumerate(s):
  if i == "?":
    s[index] = "D"
ans = "".join(s)
print(ans)

Buggy submission (verdict: Runtime Error):
s = list(input())
Pflag = False
Dflag = False
if s[0] == "?":
  if s[1] == "D":
    s[0] = "P"
  if s[1] == "P":
    s[0] = "D"
  if s[1] == "?":
    s[0] = "P"
    s[1] = "D"
if s[-1] == "?":
  s[-1] = "D"
for index, i in enumerate(s):
  if i == "?":
    if s[index+1] == "?":
      s[index] = "P"
    if s[index-1] == "P":
      s[index] = "D"
    if s[index+1] == "D":
      s[index] = "P"
ans = "".join(s)
print(ans)

Buggy submission (verdict: Runtime Error):
s = list(input())
Pflag = False
Dflag = False
if s[0] == "?":
  if s[1] == "D":
    s[0] = "P"
  if s[1] == "P":
    s[0] = "D"
  if s[1] == "?":
    s[0] = "P"
    s[1] = "D"
if s[-1] == "?":
  s[-1] = "D"
for index, i in enumerate(s):
  if i == "?":
    if s[index-1] == "P":
      s[index] = "D"
    if s[index+1] == "D":
      s[index] = "P"
    if s[index+1] == "?":
      s[index] = "P"
      s[index+1] = "D"
ans = "".join(s)
print(ans)

Buggy submission (verdict: Runtime Error):
s = list(input())
Pflag = False
Dflag = False
if s[0] == "?":
  if s[1] == "D":
      s[0] = "P"
  if s[1] == "P":
      s[0] = "D"
  if s[1] == "?":
      s[0] = "P"
      s[1] = "D"
for index, i in enumerate(s):
  if i == "?":
    if s[index-1] == "P":
      s[index] = "D"
    if s[index+1] == "D":
      s[index] = "P"
    if s[index+1] == "?":
      s[index] = "P"
      s[index+1] = "D"
ans = "".join(s)
print(ans)
Problem p02681 (python)

Fixed submission:
S = input()
T = input()
 
t = T[:-1]
 
if S == t:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
S = int(input())
T = int(input())

t = word.rstrip(T)

if S == T:
  print("Yes")
else:
  print("No")
Problem p02694 (python)

Fixed submission:
X = int(input())
A = 100
c = 0
while(A < X):
  A = int(A * 1.01)
  c = c + 1
  
print(c)

Buggy submission (verdict: Runtime Error):
X = int(input())

for i in range(X):
  if X == int(100 * (1.01 ** i)):
    print(i)
    break

Buggy submission (verdict: Runtime Error):
import math
X = int(input())
c = 0

for i in range(10**18):
  n = 1.01**i
  if X == math.floor(n*100):
    print(i)
    break

Buggy submission (verdict: Runtime Error):
import math
X = int(input())
A = 100
c = 0

for i in range(X):
  A = A * 1.01
  if math.floor(A) == X:
    c = c+1
    break
    
  c = c+1

print(c)
Problem p02705 (python)

Fixed submission:
r = int(input())
a = 2 * 3.1415 * r
print(a)

Buggy submission (verdict: Runtime Error):
r = int(input())
a = 2 * pi * r
print(a)
Problem p02924 (python)

Fixed submission:
n = int(input())
m = int(((n-1)*n)//2)
print(m)

Buggy submission (verdict: Runtime Error):
n = ii()
m = int(((n-1)*n)/2)
print(m)

Buggy submission (verdict: Runtime Error):
n = ii()

print(int(((n+1)*n)/2-n))

Buggy submission (verdict: Runtime Error):
n = ii()

print((n+1)*n/2-n)
Problem p02602 (python)

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

for i in range(k,n):
  if a[i] > a[i-k]:
    print('Yes')
  else:
    print('No')

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

for i in range(k,n+1):
  if a[i] > a[i-k]:
    print('Yes')
  else:
    print('No')
Problem p02603 (python)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
 
money = 1000
stock = 0
 
for i in range(n-1):
  if a[i+1] > a[i]:
    stock = money // a[i]
    money = money - stock*a[i] + stock*a[i+1]
 
print(money)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input()))

money = 1000
stock = 0

for i in range(n-1):
  if a[i+1] > a[i]:
    stock = money // a[i]
    money = money - stock*a[i] + stock*a[i+1]

print(money)
Problem p02639 (python)

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


if num_list[0] == 0:
  print(1)
elif num_list[1] == 0:
  print(2)
elif num_list[2] == 0:
  print(3)
elif num_list[3] == 0:
  print(4)
elif num_list[4] == 0:
  print(5)

Buggy submission (verdict: Runtime Error):
a,b,c,d,e = map(int, input().split())
r = o
if a = 0:
  r = a
  else if b = 0:
    r = b
  else if c = 0:
    r = c
  else if d = 0:
    r = d
  else if e = 0:
    r = e
print(r)
Problem p02657 (python)

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

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))

ans = 1

if 0 in A:
  ans = 0
else:
  for i in range(N):
    ans *= A[i]
    i += 1
    if ans > 10**18:
      ans = -1
      break

print(ans)

Buggy submission (verdict: Runtime Error):
a,b = int(input())
r = a * b
print(r)

Buggy submission (verdict: Runtime Error):
print(A*B)

Buggy submission (verdict: Runtime Error):
r = int(input())
r = A * B
print(r)
Problem p02658 (python)

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

ans = 1

if 0 in A:
  ans = 0
else:
  for i in range(N):
    ans *= A[i]
    i += 1
    if ans > 10**18:
      ans = -1
      break

print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))

ans = 1

if 0 in A:
  ans = 0
else:
  for i in A:
    ans *= A
    i += 1
    if ans > 10**18:
      ans = -1
      break

print(ans)
Problem p02554 (python)

Fixed submission:
n = int(input())

def p(m, n):
    k = 1
    for i in range(n):
        k = (k * m) % (10**9 + 7)
    return k

x = p(10, n) - 2*p(9, n) + p(8, n)
while x < 0:
    x += 10 ** 9 + 7
if x == 10 ** 9 + 7:
    x = 0
print(x)

Buggy submission (verdict: Runtime Error):
n = int(input())

def p(m, n):
    k = 1
    for i in range(n):
        k = (k * m) % (10**9 + 7)
    return k

x = p(10, n) - 2*p(9, n) + p(8, n)
while x < 0:
    x += 10 ** 9 + 7
elif x == 10 ** 9 + 7:
    x = 0
print(x)
Problem p02657 (python)

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

Buggy submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
s = 1
for i in range(N):
    s *= A[i]
    i += 1
if s > 10**18:
    print(-1)
else:
    print(s)
Problem p02681 (python)

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

if (len(S) == len(T) - 1) & (S == T[:-1]):
    print('Yes')
else:
    print('No')

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

route ={1}
cur = 1
for i in range(k):
    goto = a[cur - 1]
    x = len(route)
    route.add(goto)
    y = len(route)
    if x == y:
        route = list(route)
        pre_goto = route.index(goto)
        dif = len(route) - pre_goto
        rest_step = (k - pre_goto) % dif
        print(route[pre_goto + rest_step])
        break
    cur = goto
else:
    print(route[k])
Problem p02684 (python)

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

route ={1}
cur = 1
for i in range(k):
    goto = a[cur - 1]
    x = len(route)
    route.add(goto)
    y = len(route)
    if x == y:
        route = list(route)
        pre_goto = route.index(goto)
        dif = len(route) - pre_goto
        rest_step = (k - pre_goto) % dif
        print(route[pre_goto + rest_step])
        break
    cur = goto
else:
    route = list(route)
    print(route[k])

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

route ={1}
cur = 1
for i in range(k):
    goto = a[cur - 1]
    x = len(route)
    route.add(goto)
    y = len(route)
    if x == y:
        route = list(route)
        pre_goto = route.index(goto)
        dif = len(route) - pre_goto
        rest_step = (k - pre_goto) % dif
        print(route[pre_goto + rest_step])
        break
    cur = goto
else:
    print(route[k])
Problem p02687 (python)

Fixed submission:
S = input()

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

Buggy submission (verdict: Runtime Error):
x = int(input())

if x == 1:
    a = 1
    b = 0
else:
    p = 1
    while True:
        while True:
            if x % p == 0:
                q = int(x / p)
                break
            else:
                p += 1
        ap = p
        am = p
        bp = 0
        bm = 0
        for i in range(200):
            if ap**4 + ap**3 * bp + ap**2 * bp**2 + ap * bp**3 + bp**4 == q:
                a = ap
                b = bp
                break
            elif am**4 + am**3 * bm + am**2 * bm**2 + am * bm**3 + bm**4 == q:
                a = am
                b = bm
                break
            ap += 1
            bp += 1
            am -= 1
            bm -= 1
        else:
            p += 1
            continue
        break

print('{} {}'.format(a, b))

Buggy submission (verdict: Runtime Error):
n, m = map(int, input().split())
h = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]

s = 0
for i in range(1, n + 1):
    tf = True
    k = i
    for j in range(len(ab)):
        if ab[j][0] == i:
            k = ab[j][1]
        elif ab[j][1] == i:
            k = ab[j][0]
        if (k != i) & (h[i - 1] <= h[k - 1]):
            tf = False
            del ab[j]
            break
    if tf == True:
        s += 1

print(s)
Problem p02714 (python)

Fixed submission:
n = int(input())
s = input()

from collections import Counter
rgb = dict(Counter(s))
if len(rgb) < 3:
    print('0')
else:
    p = rgb['R'] * rgb['G'] * rgb['B']
    for i in range(1, (len(s)-1)//2 + 1):
        for j in range(len(s) - 2*i):
            if {s[j], s[j + i], s[j + 2*i]} == {'R', 'G', 'B'}:
                p -= 1
    print(p)

Buggy submission (verdict: Runtime Error):
n = int(input())
s = input()

from collections import Counter
rgb = dict(Counter(s))
if len(dict) < 3:
    print('0')
else:
    p = rgb['R'] * rgb['G'] * rgb['B']
    for i in range(1, (len(s)-1)//2 + 1):
        for j in range(len(s) - 2*i):
            if {s[j], s[j + i], s[j + 2*i]} == {'R', 'G', 'B'}:
                p -= 1
    print(p)

Buggy submission (verdict: Runtime Error):
n = int(input())
s = input()

from collections import Counter
rgb = dict(Counter(s))
p = rgb['R'] * rgb['G'] * rgb['B']
for i in range(1, (len(s)-1)//2 + 1):
    for j in range(len(s) - 2*i):
        if {s[j], s[j + i], s[j + 2*i]} == {'R', 'G', 'B'}:
            p -= 1
print(p)

Buggy submission (verdict: Runtime Error):
n = int(input())
s = input()

from collections import Counter
rgb = dict(Counter(s))
p = rgb['R'] * rgb['G'] * rgb['B']
for i in range(1, len(s)//2):
    for j in range(len(s) - 2*i):
        if {s[j], s[j + i], s[j + 2*i]} == {'R', 'G', 'B'}:
            p -= 1
print(p)
Problem p02717 (python)

Fixed submission:
x, y, z = map(int, input().split())
print('{} {} {}'.format(z, x, y))

Buggy submission (verdict: Runtime Error):
k = int(input())

n = 1
cnt = 0
while True:
    s = str(n)
    for i in range(len(s) - 1):
        if not int(s[i + 1]) in [int(s[i]), int(s[i]) - 1, int(s[i]) + 1]:
            break
    else:
        cnt += 1
    if cnt == k:
        break
    n += 1

print(n)
Problem p02783 (python)

Fixed submission:
h, a = map(int, input().split())

n = 0
while h > 0:
    h -= a
    n += 1
print(n)

Buggy submission (verdict: Runtime Error):
h, a = int(input())

n = 0
while h > 0:
    h -= a
    n += 1
print(n)
Problem p02811 (python)

Fixed submission:
k, x = map(int, input().split())
if 500 * k >= x:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
k, x = int(input())
if 500 * k >= x:
    print('Yes')
else:
    print('No')
Problem p02910 (python)

Fixed submission:
s = input()
sl = list(s)
for i in range(len(sl)):
    if (i + 1) % 2 == 1:
        if sl[i] == 'L':
            print('No')
            break
        else:
            continue
    else:
        if sl[i] == 'R':
            print('No')
            break
        else:
            continue
else:
    print('Yes')

Buggy submission (verdict: Runtime Error):
s = input()
sl = list(s)
for i in range(1, len(sl) + 1):
    if i % 2 == 1:
        if sl[i] == 'L':
            print('No')
            break
        else:
            continue
    else:
        if sl[i] == 'R':
            print('No')
            break
        else:
            continue
else:
    print('Yes')
Problem p03359 (python)

Fixed submission:
a,b=map(int, input().split())
if a==1:
    print(1)
elif a==2 and b<=1:
    print(1)
elif a==2 and b>=2:
    print(2)
elif a==3 and b<=2:
    print(2)
elif a==3 and b>=3:
    print(3)
elif a==4 and b<=3:
    print(3)
elif a==4 and b>=4:
    print(4)
elif a==5 and b<=4:
    print(4)
elif a==5 and b>=5:
    print(5)
elif a==6 and b<=5:
    print(5)
elif a==6 and b>=6:
    print(6)
elif a==7 and b<=6:
    print(6)
elif a==7 and b>=7:
    print(7)
elif a==8 and b<=7:
    print(7)
elif a==8 and b>=8:
    print(8)
elif a==9 and b<=8:
    print(8)
elif a==9 and b>=9:
    print(9)
elif a==10 and b<=9:
    print(9)
elif a==10 and b>=10:
    print(10)
elif a==11 and b<=10:
    print(10)
elif a==11 and b>=11:
    print(11)
elif a==12 and b<=11:
    print(11)
else:
    print(12)

Buggy submission (verdict: Runtime Error):
a,b=map(int(input()).split())
if a==1:
    print(1)
elif a==2 and b<=1:
    print(1)
elif a==2 and b>=2:
    print(2)
elif a==3 and b<=2:
    print(2)
elif a==3 and b>=3:
    print(3)
elif a==4 and b<=3:
    print(3)
elif a==4 and b>=4:
    print(4)
elif a==5 and b<=4:
    print(4)
elif a==5 and b>=5:
    print(5)
elif a==6 and b<=5:
    print(5)
elif a==6 and b>=6:
    print(6)
elif a==7 and b<=6:
    print(6)
elif a==7 and b>=7:
    print(7)
elif a==8 and b<=7:
    print(7)
elif a==8 and b>=8:
    print(8)
elif a==9 and b<=8:
    print(8)
elif a==9 and b>=9:
    print(9)
elif a==10 and b<=9:
    print(9)
elif a==10 and b>=10:
    print(10)
elif a==11 and b<=10:
    print(10)
elif a==11 and b>=11:
    print(11)
elif a==12 and b<=11:
    print(11)
else:
    print(12)
Problem p02844 (python)

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


def count_pins(n, s):
    k = 3
    if n < k or n < 1 or k < 1:
        return 0
    elif n == k:
        return 1
    v1 = [0 for _ in range(n)]
    v2 = [0 for _ in range(n)]
    v3 = [0 for _ in range(10)]
    v2[n - 1] = 1
    v3[s[n - 1] - 1] = 1
    for i in range(n - 1)[::-1]:
        v2[i] = v2[i + 1]
        if v3[s[i] - 1] == 0:
            v2[i] += 1
            v3[s[i] - 1] = 1
    for j in range(1, k):
        v3 = [0 for _ in range(10)]
        v1[n - 1] = 0
        for i in range(n - 1)[::-1]:
            v1[i] = v1[i + 1]
            v1[i] += v2[i + 1]
            v1[i] -= v3[s[i] - 1]
            v3[s[i] - 1] = v2[i + 1]
        v2 = v1[:]
    return v1[0]


def main():
    n = int(input())
    s = [int(c) for c in input()]
    res = count_pins(n, s)
    print(res)


if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3


def count_pins(n, s):
    k = 3
    if n < k or n < 1 or k < 1:
        return 0
    elif n == k:
        return 1
    v1 = [0 for _ in range(n)]
    v2 = [0 for _ in range(n)]
    v3 = [0 for _ in range(n)]
    v2[n - 1] = 1
    v3[s[n - 1] - 1] = 1
    for i in range(n - 1)[::-1]:
        v2[i] = v2[i + 1]
        if v3[s[i] - 1] == 0:
            v2[i] += 1
            v3[s[i] - 1] = 1
    for j in range(1, k):
        v3 = [0 for _ in range(n)]
        v1[n - 1] = 0
        for i in range(n - 1)[::-1]:
            v1[i] = v1[i + 1]
            v1[i] = v1[i] + v2[i + 1]
            v1[i] = v1[i] - v3[s[i] - 1]
            v3[s[i] - 1] = v2[i + 1]
        v2 = v1[:]
    return v1[0]


def main():
    n = int(input())
    s = [int(c) for c in input()]
    res = count_pins(n, s)
    print(res)


if __name__ == "__main__":
    main()
Problem p03263 (python)

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

import itertools
import sys


DELTAS = [(0, 1), (1, 0), (0, -1), (-1, 0)]


def in_stage(h, w, r, c):
    return 0 <= r < h and 0 <= c < w


def in_place_solve(h, w, stage):
    ops = []
    for r0, c0 in itertools.product(range(h), range(w)):
        tr, tc = None, None
        if stage[r0][c0] % 2 == 0:
            continue
        for dr, dc in DELTAS:
            r, c = r0 + dr, c0 + dc
            if in_stage(h, w, r, c) and stage[r][c] % 2 == 1:
                tr, tc = r, c
                break
        else:
            for dr, dc in DELTAS:
                r, c = r0 + dr, c0 + dc
                if in_stage(h, w, r, c):
                    tr, tc = r, c
                    break
        if tr is None or tc is None:
            continue
        ops.append((r0 + 1, c0 + 1, tr + 1, tc + 1))
        stage[r0][c0] -= 1
        stage[tr][tc] += 1
    return ops


def main():
    h, w = (int(x) for x in input().split())
    stage = [[int(x) for x in input().split()] for _ in range(h)]
    # print("Before: ", file=sys.stderr)
    # print(*stage, sep="\n", file=sys.stderr)
    ops = in_place_solve(h, w, stage)
    # print("After: ", file=sys.stderr)
    # print(*stage, sep="\n", file=sys.stderr)
    print(len(ops))
    for y0, x0, y, x in ops:
        print(y0, x0, y, x)


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3

import itertools
import sys


DELTAS = [(0, 1), (1, 0), (0, -1), (-1, 0)]


def in_stage(h, w, r, c):
    return 0 <= r < h and 0 <= c < w


def in_place_solve(h, w, stage):
    ops = []
    for r0, c0 in itertools.product(range(h), range(w)):
        tr, tc = None, None
        if stage[r0][c0] % 2 == 0:
            continue
        for dr, dc in DELTAS:
            r, c = r0 + dr, c0 + dc
            if in_stage(h, w, r, c) and stage[r][c] % 2 == 1:
                tr, tc = r, c
                break
        else:
            for dr, dc in DELTAS:
                r, c = r0 + dr, c0 + dc
                if in_stage(h, w, r, c):
                    tr, tc = r, c
                    break
        ops.append((r0 + 1, c0 + 1, tr + 1, tc + 1))
        stage[r0][c0] -= 1
        stage[tr][tc] += 1
    return ops


def main():
    h, w = (int(x) for x in input().split())
    stage = [[int(x) for x in input().split()] for _ in range(h)]
    # print("Before: ", file=sys.stderr)
    # print(*stage, sep="\n", file=sys.stderr)
    ops = in_place_solve(h, w, stage)
    # print("After: ", file=sys.stderr)
    # print(*stage, sep="\n", file=sys.stderr)
    print(len(ops))
    for y0, x0, y, x in ops:
        print(y0, x0, y, x)


if __name__ == '__main__':
    main()