TnT/CodeNet4Repair huggingface dataset:
Problem:
You are going out for a walk, when you suddenly encounter a monster. Fortunately, you have N katana (swords), Katana 1, Katana 2, …, Katana N, and can perform the following two kinds of attacks in any order:    * Wield one of the katana you have. When you wield Katana i (1 ≤ i ≤ N), the monster receives a_i points of damage. The same katana can be wielded any number of times.   * Throw one of the katana you have. When you throw Katana i (1 ≤ i ≤ N) at the monster, it receives b_i points of damage, and you lose the katana. That is, you can no longer wield or throw that katana.  The monster will vanish when the total damage it has received is H points or more. At least how many attacks do you need in order to vanish it in total?

Incorrect submission (verdict: Wrong Answer):
n,h = map(int,input().split())
l = []
x,y = 0,0
for _ in range(n):
    a,b = map(int,input().split())
    if a > x or a == x and b < y:
        x,y = a,b
    if b < x:continue
    l.append((a,b))
l.remove((x,y))
l = sorted(l,key=lambda x:-x[1])
ans = 0
for a,b in l:
    if a == x and b == y:continue 
    if x < b < y and y >= h:
        print(ans+1);exit()
    h -= max(b,x)
    ans += 1
    if h <= 0:
        print(ans);exit()

r = (max(0,h - y)) // x

print(ans + r + 1)


Fixed, accepted submission:
import math
n,h = map(int,input().split())
A = 0; b = []; ans = 0
for _ in range(n):
    u,v = map(int,input().split())
    A = max(A,u); b.append(v)

for B in sorted(b,key=lambda x:-x):
    if h <= 0 or B <= A:break
    h -= B
    ans += 1
print(max(0,math.ceil(h/A)) + ans)
Problem:
You are given an integer sequence of length N, a_1,a_2,...,a_N.  For each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.  After these operations, you select an integer X and count the number of i such that a_i=X.  Maximize this count by making optimal choices.

Incorrect submission (verdict: Wrong Answer):
n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 1


for i in range(n-1):
    for j in range(i+1, n):
        if j > i + 2:
            if j - i > ans:
                ans = j - i
            break
print(ans)

Fixed, accepted submission:
n = int(input())
a = list(map(int,input().split()))
cnt = [0] * int(1e6)
for i in a:
    cnt[i-1] += 1
    cnt[i] += 1
    cnt[i+1] += 1
print(max(cnt))
Problem:
Find the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).

Incorrect submission (verdict: Wrong Answer):
n, a, b = map(int, input().split())

ans = 0
for x in range(1,n+1):
    print('x=='+str(x))
    sum = 0
    y = x
    while x > 0:
        sum += x%10
        x = int(x/10)
    if a<= sum <= b: 
        print(a)
        ans += y
print(ans)

Fixed, accepted submission:
n, a, b = map(int, input().split())

ans = 0
for x in range(1,n+1):
    sum = 0
    y = x
    while x > 0:
        sum += x%10
        x = int(x/10)
    if a<= sum <= b: 
        ans += y
print(ans)
Problem:
AtCoDeer the deer recently bought three paint cans. The color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c. Here, the color of each paint can is represented by an integer between 1 and 100, inclusive.  Since he is forgetful, he might have bought more than one paint can in the same color. Count the number of different kinds of colors of these paint cans and tell him.

Incorrect submission (verdict: Wrong Answer):
t=[int(i) for i in input().split()]
t.sort()
print(t)
a=1
for j in range(1,len(t)):
    if t[j-1]<t[j]:
        a=a+1
print(a)


Fixed, accepted submission:
t=[int(i) for i in input().split()]
t.sort()
#print(t)
a=1
for j in range(1,len(t)):
    if t[j-1]<t[j]:
        a=a+1
print(a)
Problem:
An elementary school student Takahashi has come to a variety store.  He has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?  Note that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.

Incorrect submission (verdict: Wrong Answer):
money = input().split()
#print(money)
myMoney = int(money[0]) + int(money[1])
#print(myMoney)
if myMoney >= int(money[2]):
    print("yes")
else:
    print("no")

Fixed, accepted submission:
money = input().split()
#print(money)
myMoney = int(money[0]) + int(money[1])
#print(myMoney)
if myMoney >= int(money[2]):
    print("Yes")
else:
    print("No")
Problem:
You are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1.

Incorrect submission (verdict: Wrong Answer):
a = input()
counter = 0
b =""

for x in a:
    if counter %2 == 0:
        pass
    else:
        b +=x
    counter +=1

print(b)

Fixed, accepted submission:
a = input()
counter = 1
b =""
 
for x in a:
    if counter %2 == 0:
        pass
    else:
        b +=x
    counter +=1
 
print(b)
Problem:
Write a program which counts and reports the number of each alphabetical letter. Ignore the case of characters.

Incorrect submission (verdict: Wrong Answer):
sen = input()
sen.lower()
res = [0 for i in range(26)]
for c in sen:
    if 'a' <= c <= 'z':
        res[ord(c)-ord('a')] += 1
alp = [chr(i) for i in range(ord('a'), ord('z')+1)]
for i in range(26):
    print(alp[i] + ' : ' + str(res[i]))

Fixed, accepted submission:
sen = ''
while True:
    try:
        sen += input().lower()
    except:
        break
res = [0 for i in range(26)]
for c in sen:
    if 'a' <= c <= 'z':
        res[ord(c)-ord('a')] += 1
alp = [chr(i) for i in range(ord('a'), ord('z')+1)]
for i in range(26):
    print(alp[i] + ' : ' + str(res[i]))
Problem:
There are N positive integers written on a blackboard: A_1, ..., A_N.  Snuke can perform the following operation when all integers on the blackboard are even:    * Replace each integer X on the blackboard by X divided by 2.  Find the maximum possible number of operations that Snuke can perform.

Incorrect submission (verdict: Time Limit Exceeded):
n=int(input())
data=list(map(int, input().split()))
count = 0
while(True):
  data = list(filter(lambda x: x%2==0, data))
  if len(data) < n:
    print(count)
    break
  else:
    count+=1

Fixed, accepted submission:
n=int(input())
data=list(map(int, input().split()))
for i in range( max(data)):
  even_data = list(filter(lambda x: x%2==0, data))
  if len(even_data) < n:
    print(i)
    break
  data = list(map( lambda x: x / 2,  data))
Problem:
Snuke is making sugar water in a beaker. Initially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.    * Operation 1: Pour 100A grams of water into the beaker.   * Operation 2: Pour 100B grams of water into the beaker.   * Operation 3: Put C grams of sugar into the beaker.   * Operation 4: Put D grams of sugar into the beaker.  In our experimental environment, E grams of sugar can dissolve into 100 grams of water.  Snuke will make sugar water with the highest possible density.  The beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker. Find the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it. If there is more than one candidate, any of them will be accepted.  We remind you that the sugar water that contains a grams of water and b grams of sugar is \frac{100b}{a + b} percent. Also, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.

Incorrect submission (verdict: Wrong Answer):
a, b, c, d, e, f = map(int, input().split())

waters = []
sugars = []

for w in range(f // 100):
    for i in range(0, w, a):
        if (w - i) % b == 0:
            waters.append(w)
            break
for s in range(f):
    for i in range(0, s, c):
        if (s - i) % d == 0:
            sugars.append(s)
            break

answ = 1
anss = 0

for w in waters:
    for s in sugars:
        if 100 * w + s > f:
            continue
        if s > e * w:
            continue
        if w == 0:
            continue
        if s / w > anss / answ:
            answ = w
            anss = s
print(answ*100+anss, anss)


Fixed, accepted submission:
a, b, c, d, e, f = map(int, input().split())

waters = []
sugars = []

for w in range(f // 100):
    for i in range(0, w+1, a):
        if (w - i) % b == 0:
            waters.append(w)
            break
for s in range(f):
    for i in range(0, s+1, c):
        if (s - i) % d == 0:
            sugars.append(s)
            break

answ = a
anss = 0

for w in waters:
    for s in sugars:
        if 100 * w + s > f:
            continue
        if s > e * w:
            continue
        if w == 0:
            continue
        if s / w > anss / answ:
            answ = w
            anss = s
print(answ*100+anss, anss)
Problem:
Iroha has a sequence of N strings S_1, S_2, ..., S_N. The length of each string is L.  She will concatenate all of the strings in some order, to produce a long string.  Among all strings that she can produce in this way, find the lexicographically smallest one.  Here, a string s=s_1s_2s_3...s_n is _lexicographically smaller_ than another string t=t_1t_2t_3...t_m if and only if one of the following holds:    * There exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j<i), and s_i<t_i.   * s_i = t_i for all integers i(1≦i≦min(n,m)), and n<m.

Incorrect submission (verdict: Wrong Answer):
n, l = map(int, input().split())
s_list = [input() for i in range(n)]

s_sorted = []
for s in s_list:
    sum_s_elem = ''
    for ss in sorted(s):
        sum_s_elem += ss
    s_sorted.append(sum_s_elem)
print(s_sorted)

sum_s = ''
for s in sorted(s_sorted):
    sum_s += s
print(sum_s)

Fixed, accepted submission:
n, l = map(int, input().split())
s_list = [input() for i in range(n)]

sum_s = ''
for s in sorted(s_list):
    sum_s += s
print(sum_s)
Problem:
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:    * Hit his pocket, which magically increases the number of biscuits by one.   * Exchange A biscuits to 1 yen.   * Exchange 1 yen to B biscuits.  Find the maximum possible number of biscuits in Snuke's pocket after K operations.

Incorrect submission (verdict: Wrong Answer):
K,A,B =[int(i)for i in input().split()]
if A+2 >= B or K <= A:
    print(K+1)
else:
    N = K -A+1
    N =N//2
    print(N,K+1,(B-A-2))
    print(K+1+(B-A-2)*N)

Fixed, accepted submission:
K,A,B =[int(i)for i in input().split()]
if A+2 >= B or K <= A:
    print(K+1)
else:
    N = K -A+1
    N =N//2
    print(K+1+(B-A-2)*N)
Problem:
You are given a string S consisting of lowercase English letters. Another string T is initially empty. Determine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:    * Append one of the following at the end of T: `dream`, `dreamer`, `erase` and `eraser`.

Incorrect submission (verdict: Wrong Answer):
s = input()

s1 = "".join(s.split('dreameraser'))

s2 = "".join(s1.split('dreamerase'))

s3 = "".join(s2.split('dreamer'))

s4 = "".join(s3.split('dreame'))

s5 = "".join(s4.split('eraser'))

s6 = "".join(s5.split('erase'))

if s6 == '':
    print('YES')
else:
    print('NO')

Fixed, accepted submission:
def f1():
    s = input()
    while s:
        if s[-5:] in ['dream', 'erase']:
            s = s[:-5]
        elif s[-6:] == 'eraser':
            s = s[:-6]
        elif s[-7:] == 'dreamer':
            s = s[:-7]
        else:
            print('NO')
            return
    print('YES')

if __name__ == "__main__":
    f1()
Problem:
Write a program which reads two integers a and b, and calculates the following values:    * a ÷ b: d (in integer)   * remainder of a ÷ b: r (in integer)   * a ÷ b: f (in real number)

Incorrect submission (verdict: Wrong Answer):
nums=[]
nums=input().split()
for i in range(0,len(nums)):
    nums[i]=int(nums[i])
print(nums[0]//nums[1],nums[0]%nums[1],nums[0]/nums[1])

Fixed, accepted submission:
a,b=map(int,input().split())
print(a//b,a%b,"{0:.5f}".format(a/b))
Problem:
Ringo is giving a present to Snuke.  Ringo has found out that Snuke loves _yakiniku_ (a Japanese term meaning grilled meat. _yaki_ : grilled, _niku_ : meat). He supposes that Snuke likes grilled things starting with `YAKI` in Japanese, and does not like other things.  You are given a string S representing the Japanese name of Ringo's present to Snuke. Determine whether S starts with `YAKI`.

Incorrect submission (verdict: Wrong Answer):
n = input()
print("No" if len(n) < 4 else "Yes" if n[:4] is "YAKI" else "No")

Fixed, accepted submission:
n = input()
print("No" if len(n) < 4 else "Yes" if n[:4] == "YAKI" else "No")
Problem:
The word `internationalization` is sometimes abbreviated to `i18n`. This comes from the fact that there are 18 letters between the first `i` and the last `n`.  You are given a string s of length at least 3 consisting of lowercase English letters. Abbreviate s in the same way.

Incorrect submission (verdict: Wrong Answer):
s = "s" + input() + "s"
s = s[1:-1]
print(len(s))

Fixed, accepted submission:
s = input()
s1 = s[1:-1]
print(s[0] + str(len(s1)) + s[-1])
Problem:
The postal code in Atcoder Kingdom is A+B+1 characters long, its (A+1)-th character is a hyphen `-`, and the other characters are digits from `0` through `9`.  You are given a string S. Determine whether it follows the postal code format in Atcoder Kingdom.

Incorrect submission (verdict: Wrong Answer):
a,b = map(int,input().split())
s = input()
if s[a] == "-":
    s = s[0:a] + s[a:a+b+1]
    for i in s:
        if i == "-":
            print("No")
            exit()
    print("Yes")
else:
    print("No")

Fixed, accepted submission:
a,b = map(int,input().split())
s = input()
if s[a] == "-":
    s = s[0:a] + s[a+1:a+b+1]
    for i in s:
        if i == "-":
            print("No")
            exit()
    print("Yes")
else:
    print("No")
Problem:
There are a total of A + B cats and dogs. Among them, A are known to be cats, but the remaining B are not known to be either cats or dogs.  Determine if it is possible that there are exactly X cats among these A + B animals.

Incorrect submission (verdict: Wrong Answer):
a,b,x = map(int,input().split())
print("Yes" if a<=x  and  x<=a+b else "No")

Fixed, accepted submission:
a,b,x = map(int,input().split())
print("YES" if a<=x<=a+b else "NO")
Problem:
Niwango-kun is an employee of Dwango Co., Ltd.   One day, he is asked to generate a thumbnail from a video a user submitted.   To generate a thumbnail, he needs to select a frame of the video according to the following procedure:    * Get an integer N and N integers a_0, a_1, ..., a_{N-1} as inputs. N denotes the number of the frames of the video, and each a_i denotes the representation of the i-th frame of the video.   * Select t-th frame whose representation a_t is nearest to the average of all frame representations.   * If there are multiple such frames, select the frame with the smallest index.  Find the index t of the frame he should select to generate a thumbnail.

Incorrect submission (verdict: Wrong Answer):
N = int(input())
a = [int(_) for _ in input().split()]
ave = sum(a)/N
Min = sum(a)
res = 0

for i in range(N):
    if abs(ave - a[i]) < Min:
        Min = abs(ave - a[i])
        res = i

print(i)

Fixed, accepted submission:
N = int(input())
a = [int(_) for _ in input().split()]
ave = sum(a)/N
Min = sum(a)
res = 0

for i in range(N):
    if abs(ave - a[i]) < Min:
        Min = abs(ave - a[i])
        res = i

print(res)
Problem:
「ぐるぐる模様」を表示するプログラムを作成することにしました。「ぐるぐる模様」は以下のようなものとします。    * 1 辺の長さが n の場合、n 行 n 列の文字列として表示する。   * 左下隅を基点とし，時計回りに回転する渦状の模様とする。   * 線のある部分は #（半角シャープ）、空白部分は " "（半角空白）で表現する。   * 線と線の間は空白を置く。  整数 n を入力とし，1 辺の長さが n の「ぐるぐる模様」を出力するプログラムを作成してください。

Incorrect submission (verdict: Wrong Answer):
vector = ((0, -1), (1, 0), (0, 1), (-1, 0))

def make_guruguru(d):
  lst = [["#"] * (d + 4)]
  for _ in range(d + 2):
    lst.append(["#"] + [" "] * (d + 2) + ["#"])
  lst.append(["#"] * (d + 4))
  x, y = 2, d + 1
  lst[y][x] = "#"
  direct = 0
  vx, vy = vector[0]
  cnt = 1
  while True:
    while lst[y + vy * 2][x + vx * 2] == " ":
      lst[y + vy][x + vx] = "#"
      y += vy
      x += vx
      cnt += 1
    if cnt <= 1:
      break
    direct = (direct + 1) % 4
    vx, vy = vector[direct]
    cnt = 0
  for y in range(2, d + 2):
    print("".join(lst[y][2:-2]))
  print()
  for line in lst:
    print("".join(line))

n = int(input())
for _ in range(n):
  d = int(input())
  make_guruguru(d)


Fixed, accepted submission:
vector = ((0, -1), (1, 0), (0, 1), (-1, 0))

def make_guruguru(d):
  lst = [["#"] * (d + 4)]
  for _ in range(d + 2):
    lst.append(["#"] + [" "] * (d + 2) + ["#"])
  lst.append(["#"] * (d + 4))
  x, y = 2, d + 1
  lst[y][x] = "#"
  direct = 0
  vx, vy = vector[0]
  cnt = 1
  while True:
    while lst[y + vy * 2][x + vx * 2] == " ":
      lst[y + vy][x + vx] = "#"
      y += vy
      x += vx
      cnt += 1
    if cnt <= 1:
      break
    direct = (direct + 1) % 4
    vx, vy = vector[direct]
    cnt = 0
  for y in range(2, d + 2):
    print("".join(lst[y][2:-2]))

n = int(input())
make_guruguru(int(input()))
for _ in range(n - 1):
  print()
  make_guruguru(int(input()))
Problem:
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.  If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that **he cannot stay at his place**. Determine whether he can carry out his plan.

Incorrect submission (verdict: Wrong Answer):
N = int(input())
T = [0]*100000
X= [0]*100000
Y= [0]*100000
o_x = 0
o_y = 0

for n in range(N):
        T[n],X[n],Y[n] = (map(int, input().split()))

flag = 1
for n in range(N):
    #print(n)
    if flag == 0:
        continue

    if n == 0:
        count = T[n]
    else:
        count = T[n] - T[n-1]
        o_x = X[n-1]
        o_y = Y[n-1]
    c = 0
    x = o_x
    y = o_y

    end = 0
    while True:
        if end == 1:
            break
        s_x = X[n] - x
        s_y = Y[n] - y
    #    print(str(x)+' '+str(y))

        if ((s_x >= 0 or s_y >= 0) )and (c!=count):
            if s_x >0:
                x +=1
                c += 1
            elif s_x < 0:
                x -= 1
                c+=1
            elif s_y > 0:
                y +=1
                c += 1
            elif s_y < 0:
                y -= 1
                c+=1
            elif s_x==0:
                x +=1
                c +=1

        elif c==count:
            if (x == X[n] and y ==Y[n]):
                flag = 1
                end=1
            else:
                flag=0
                end =1


if flag == 1:
    print('YES')
else:
    print('NO')


Fixed, accepted submission:
N  = int(input())
t = [0]*110000
x= [0]*110000
y= [0]*110000

for n in range(N):
        t[n+1],x[n+1],y[n+1] = (map(int, input().split()))

can = True

for i in range(N):
    dt = t[i+1] - t[i]
    dist = abs(x[i+1] - x[i]) + abs(y[i+1] - y[i])

    if dt < dist: 
        can = False
    if (dist % 2 != dt % 2):
        can = False

if can == True:
    print('Yes')
else:
    print('No')
Problem:
Takahashi is competing in a sumo tournament. The tournament lasts for 15 days, during which he performs in one match per day. If he wins 8 or more matches, he can also participate in the next tournament.  The matches for the first k days have finished. You are given the results of Takahashi's matches as a string S consisting of `o` and `x`. If the i-th character in S is `o`, it means that Takahashi won the match on the i-th day; if that character is `x`, it means that Takahashi lost the match on the i-th day.  Print `YES` if there is a possibility that Takahashi can participate in the next tournament, and print `NO` if there is no such possibility.

Incorrect submission (verdict: Wrong Answer):
str1 = input() + "ooooooooooooooo"

count1 = 0

for i in range(15):
    if str1[i] == "o":
        count1 +=1

if count1 >= 8:
    print("yes")
else:
    print("no")

Fixed, accepted submission:

str1 = input() + "ooooooooooooooo"

count1 = 0

for i in range(15):
    if str1[i] == "o":
        count1 +=1

if count1 >= 8:
    print("YES")
else:
    print("NO")
Problem:
You are given a positive integer X. Find the largest _perfect power_ that is at most X. Here, a perfect power is an integer that can be represented as b^p, where b is an integer not less than 1 and p is an integer not less than 2.

Incorrect submission (verdict: Wrong Answer):
x = int(input())

# l[base][shoulder]
l = [[0 for i in range(10)] for i in range(32)]

ans = 1
for i in range(10):
    for j in range(32):
        tes = (j+1)**(i+1)
        if tes <= x and tes >= ans:
            ans = tes

print(ans)

Fixed, accepted submission:
x = int(input())

ans = 1
for i in range(1,11):
    for j in range(32):
        tes = (j+1)**(i+1)
        if tes <= x and tes >= ans:
            ans = tes

print(ans)
Problem:
The word `internationalization` is sometimes abbreviated to `i18n`. This comes from the fact that there are 18 letters between the first `i` and the last `n`.  You are given a string s of length at least 3 consisting of lowercase English letters. Abbreviate s in the same way.

Incorrect submission (verdict: Wrong Answer):
list=[s for s in input()]
med=len(list)
print(list[0]+str(med)+list[med-1])

Fixed, accepted submission:
N=input()
Ini=N[0]
End=N[len(N)-1]
Med=len(N)-2

LIST=[Ini,str(Med),End]
print("".join(LIST))
Problem:
The commonly used bills in Japan are 10000-yen, 5000-yen and 1000-yen bills. Below, the word "bill" refers to only these.  According to Aohashi, he received an otoshidama (New Year money gift) envelope from his grandfather that contained N bills for a total of Y yen, but he may be lying. Determine whether such a situation is possible, and if it is, find a possible set of bills contained in the envelope. Assume that his grandfather is rich enough, and the envelope was large enough.

Incorrect submission (verdict: Wrong Answer):
n, y = map(int, input().split())
check = 0
for i in range(n+1):
    for j in range(n+1-i):
        for k in range(n+1-i-j):
            if 10000*i + 5000*j + 1000*k == y:
                print(str(i) + ' ' + str(j) + ' ' + str(k))
                check += 1
                break
            else:
                continue
if check != 1:
    print('-1 -1 -1')

Fixed, accepted submission:
n, y = map(int, input().split())
a = -1 #10000
b = -1 #5000
c = -1 #1000
for i in range(n + 1):
    if n + 1 - i > 0:
        for j in range(n + 1 - i):
            k = n - i - j
            if 10000 * i + 5000 * j + 1000 * k == y:
                a = i
                b = j
                c = k
                break
    else:
        if 10000 * (n + 1) == y:
            a = n + 1
            b = n + 1 - i
            c = n + 1 - i
            break
        else:
            continue
print('{} {} {}'.format(a, b, c))
Problem:
We will buy a product for N yen (the currency of Japan) at a shop.  If we use only 1000-yen bills to pay the price, how much change will we receive?  Assume we use the minimum number of bills required.

Incorrect submission (verdict: Wrong Answer):
N=int(input(""))

A = N % 1000

print(A)

Fixed, accepted submission:
N=int(input(""))

A = N % 1000

if A > 0:
      B=1000-A
      print(B)
else:
      print(A)