peterverebics/CodeNet_Python_118 huggingface dataset:
N,R = map(int,input().split())
if N >=10:
    print(R)
else:
    print(100*(10-N)+R)
n, r = map(int,input().split())
if n >= 10:
    print(r)
else:
    print(r + 100*(10-n))
i = list(map(int, input().split()))
if i[0]<10:
    print (i[1]+100*(10-i[0]))
else:
    print (i[1])
n, r = map(int, input().split())
if n >= 10:
    print(r)
else:
    print(r + (10 - n) * 100)
raw_input = input()
l = raw_input.split()
N = int(l[0])
R = int(l[1])

if N <10:
    R_in = 100 * (10 - N) + R
    print(R_in)
else:
    print(R)
N,R=map(int,input().split())

if N>=10:
    print(int(R))

else:
    x=R+100*(10-N)
    print(int(x))
n, r = map(int, input().split())
if n < 10:
  print(r + (10 - n) * 100)
else:
  print(r)
n, r = map(int, input().split(" "))
if  n < 10:
  print(r + 100 * (10 - n))
else:
  print(r)
n, r = map(int, input().split())
if n >=10:
    print(r)
else:
    print(r + 100*(10-n))
n, r = map(int, input().split(' '))

if n >= 10:
    ans = r
else:
    ans = r + 100 * (10 - n)

print(ans)
nr =  list(map(int, input().split()))

if nr[0] < 10 :
    print(nr[1]+100*(10-nr[0]))
else:
    print(nr[1])
# 2020/02/22
# AtCoder Beginner Contest 156 - A

# Input
n, r = map(int,input().split())

# Calc
if n >= 10:
    ans = r
else:
    ans = r + (100 * (10 - n))

# Output
print(ans)
N,R = (int(x) for x in input().split())

if N >= 10:
  print(R)
  
else:
  print(100*(10-N)+R)
arr=input().split(" ")
n,r=int(arr[0]),int(arr[1])

if n<10:
    print(r+100*(10-n))
else:
    print(r)
n, r = map(int, input().split())
n = 10 if n > 10 else n
print(r + 100*(10-n))
n, r = map(int, input().split())
ans = 0

if n < 10:
  print(r + 100 * (10 - n))
else:
  print(r)
N, R = map(int, input().split())
if N >= 10:
  ans = R
else:
  ans = R + 100*(10-N)
print(ans)
n, r = map(int, input().split())
if n >= 10:
  print(r)
else:
  print(r + 100 * (10 - n))
N,R=list(map(int,input().split()))
if N>10:
    print(R)
else:
    print(R+100*(10-N))
N,R=map(int,input().split())

if N>=10:
    print(R)
else:
    ans=R+100*(10-N)
    print(ans)
N,R = map(int,input().split())
if N >= 10:
    print(R)
else:
    print(R + 100*(10-N))
n, r = [int(i) for i in input().split()]
res = r if n >= 10 else r + 100*(10-n)
print(res)
N, R = map(int, input().split())
if N >= 10:
    print(R)
else:
    print(100 * (10 - N) + R)
n,r = map(int, input().split())
if n >= 10:
  print(r)
else:
  print(r + 100 * (10 - n))
N, R = map(int,input().split())

if N < 10:
  ans = R + 100 * (10 - N)
else:
  ans = R

print(ans)
# abc156_a.py
N, R = map(int,input().split())
if N>=10:
    print(R)
else:
    print(R + 100*(10-N))
a,b=map(int,input().split())
if(a>=10):
    print(b)
else:
    print(b+100*(10-a))
def main():
    N, R = map(int, input().split())
    ans = R + 100 * max(10-N, 0)
    print(ans)


if __name__ == "__main__":
    main()
N,R = map(int, input().strip().split(' '))
print(R+100*max(0,10-N))
N, R =map(int,input().split())
print(R+100*max(10-N, 0))
n, r = map(int, input().split())

if n >= 10:
    x = r
    print(x)
else:
    x = r + 100 * (10 - n)
    print(x)
def main():
    n, r = map(int, input().split(" "))
    if n > 10:
        print(r)
    else:
        print(r + ((10 - n) * 100))


if __name__ == '__main__':
    main()
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")


# 処理内容
def main():
    N, R = map(int, input().split())
    if N >= 10:
        print(R)
    else:
        print(R + 100 * (10 - N))


if __name__ == '__main__':
    main()
import sys
n, R = [int(x) for x in input().split()]
if n >= 10:
  print(R)
  sys.exit()
  
print(R+100*(10-n))
N, R = input().split()
N = int(N)
R = int(R)

if N >= 10:
  print(R)
else:
  print(R + (100 * (10 - N)))
N,R = map(int,input().split())

if(N>=10):
  print(R)
else:
  print(R+100*(10-N))
import numpy as np
import math as m

def main(**kwargs):
    if n >= 10:
        r = k

    else:
        r = k + 100 * (10 - n)

    return r

if __name__ == "__main__":
    cin = np.array(input().split(" ")).astype("int")
    n, k = cin

    cout = main(n=n, k=k)
    print(cout)
n,r = map(int, input().split())
if n<10:
    print(r+100*(10-n))
else:
    print(r)
# 156 A

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

if n < 10:
    print(r + (100 * (10 - n)))
else:
    print(r)
n, r = map(int, input().split())
if (n >= 10):
    x = r
else:
    x = 100 * (10 - n) + r
print(x)
n,r = map(int, input().split())

if n < 10:
  print(r + 100 * (10 - n))
else:
  print(r)
def main():
    n,r = map(int, input().split())
    if n < 10:
        print(r + 100*(10 - n))
    else:
        print(r)
    return
main()
n, r = map(int, input().split(" "))

if n < 10:
    print((100*(10-n)+r))
else:
    print(r)
import numpy as np

N, R = map(int, input().split())

if 10 <= N:
  print(R)
else:
  print(R+100*(10-N))
n, r = map(int, input().split())
if n < 10:
    x = r + (100*(10-n))
else:
    x = r

print(x)
n, r = map(int, input().split())
if n >= 10:
    inner_rating = r
    print(inner_rating)
else:
    inner_rating = r + (100 * (10 - n))
    print(inner_rating)
n,r=map(int,input().split());print(r+max(0,1000-100*n))
import sys

N, R = map(int, sys.stdin.buffer.read().split())
rate = R

if N < 10:
  rate += 100 * (10 - N)

print(rate)
n,r = map(int,input().split())
print(r if n >= 10 else r + 100*(10-n))
N,R=map(int,input().split())
print(R+(100*(10-N) if N<10 else 0))
#input
N, R = map(int, input().split())

#output
if N >= 10:
    S = R
else:
    S = R + 100*(10-N)

print(S)
n, r = map(int, input().split())
ans = r if n >= 10 else r + (100 * (10 - n))
print(ans)
import sys
import decimal # 10進法に変換，正確な計算

def input():
    return sys.stdin.readline().strip()

def main():
    n, r = map(int, input().split())
    if n >= 10:
        print(r)
        return
    ans = r + 100*(10-n)
    print(ans)
    

main()
n,r=map(int,input().split())
if n<10:
  print(r+100*(10-n))
else:
  print(r)
n = list(map(int,input().split()))
if n[0]<10:
    print(100*(10-n[0])+n[1])
else:
    print(n[1])
n, r = map(int, input().split())

if n < 10:
  print(r+100*(10-n))
else:
  print(r)
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
n,r = map(int, input().split())

if n >= 10:
  print(r)
else:
  print(r+(100*(10-n)))
n,r = map(int,input().split())
ans = 0

if n >= 10:
  ans = r
else:
  ans = r + (100 * (10 - n))
  
print(ans)
a = []
a = input().split()
N = int(a[0])
R = int(a[1])

if N >= 10:
  Rate = R
else:
  Rate = R + 100 * (10 - N)

print(Rate)



#print('N=', N, 'R=', R)
n, rating = map(int, input().split())

if n >= 10:
  print(rating)
if n < 10:
  print(rating + (10 - n)*100)
N, R = map(int,input().split())
ans = 0
if N < 10:
    ans = R + (100 * (10 - N))
else:
    ans = R
print(ans)
n, r = map(int,input().split())
if n >= 10:
    print(r)
else:
    print(str(r+100*(10-n)))
a,b=map(int,input().split())
if a>=10:
  print(b)
else:
  print(b+100*(10-a))
N,R = map(int, input().split())
if N>=10:
  print(R)
else:
  print(R+100*(10-N))
n,r = map(int, input().split())

if n>= 10:
  print (r)
else:
  print (r+100*(10-n))
import sys

def ISI(): return map(int, sys.stdin.readline().rstrip().split())

n, r = ISI()
if n<10:
	r+=100*(10-n)
print(r)
N, R = map(int, input().split())

print(R if N >= 10 else R + (100 * (10 - N)))
e_cnt, disp_rate = map(int, input().split())
if e_cnt >= 10:
    print(disp_rate)
else:
    print(disp_rate + (100 * (10 - e_cnt)))
N, R = map(int, input().split())
if N >= 10:
  print(R)
  exit()
else:
	print(100 * (10 - N) + R)
#!/usr/bin/env python3

n,r = [int(i) for i in input().split()]

if n < 10:
    print(r+100*(10-n))
else:
    print(r)
N, R = map(int, input().split())
if N >= 10:
    print(R)
else:
    print(R+(10-N)*100)
N, R = map(int, input().split())
ans = 0

if(N>=10):
  ans = R
else:
  ans = R + 100*(10 - N)

print(ans)
import numpy as np

N, R = list(map(int, input().split()))

if N < 10:
    result = R + (10 - N) * 100
else:
    result = R
print(result)
n,r=input().split()
N=int(n)
R=int(r)
if N>=10:
    print(R)
else:
    print(R+100*(10-N))
n, r = input().split()
n = int(n)
r = int(r)


if n < 10:
    ans = r + 100*(10-n)
else:
    ans = r
print(ans)
i = input()
N, R = map(int, i.split())

if N >= 10: print(R) 
else: print(R + 100 * (10-N))
N, K = map(int, input().split())
if N >= 10:
    print(K)
else:
    print(K + 100*(10-N))
# problem A
N, R = input().split()
n = int(N)
r = int(R)

if n >= 10:
    print(r)
else:
    print(r+100*(10-n))
n,r=map(int,input().split())
print(r if n>9else r+100*(10-n))
N,R = map(int,input().split())
if N >= 10:
    print(R)
else:
    print(R + (100 * (10 - N)))
m = input("")
list = m.split(" ")
if eval(list[0])<10:
    print(eval(list[1])+100*(10-eval(list[0])))
if eval(list[0])>=10:
    print(eval(list[1]))
n,r = map(int,input().split())
print(r+100*(10-(min(n,10))))
a,b=map(int,input().split())
if a>=10:
  print(b)
else:
  res=100*(10-a)
  print(res+b)
N, R = map(int, input().split())

if N >= 10:
  rating = R
else:
  rating = R + 100 *  (10 - N)
  
print(rating)
N, R = map(int, input().split())
print(R if N >= 10 else R + 100*(10-N))
#template
from collections import Counter
def inputlist(): return [int(j) for j in input().split()]
#template
N,R = inputlist()
if N < 10:
    R += 100*(10-N)
print(R)
n,r = map(int,input().split())
if n >= 10:
    print(r)
else:
    print(100*(10-n)+r)
N,R=list(map(int, input().split()))
if N>=10:
  print(R)
else:
  print(R+(10-N)*100)
from sys import stdin

def main():

    input = stdin.readline

    N,R = map(int,input().split())

    if(N>=10):
        print(R)
    else:
        print(R+100*(10-N))

if __name__ == "__main__":
    main()
n,r=map(int,input().split())
if n<10:
    print(r+100*(10-n))
else:
    print(r)
n, r = map(int, input().split())
print(r if n >= 10 else r + 100 * (10 - n))
n,r=map(int,input().split())
ans=r
if(n<10):ans+=100*(10-n)
print(ans)
n,r = map(int,input().split())
print(r + 100*max(0,10-n))
n,r = map(int,input().split())
if n >= 10:
    print(r)
else:
    print(r + (100 * (10 - n)))
N,R = map(int,input().split())
if(N>=10):
  print(R)
else:
  print(R+100*(10-N))
n, r = map(int, input().split())
if n >= 10:
  print(r)
else:
  print(r + (100*(10 - n)))
# input
N, R = map(int, input().split())

# output
ans = R
if N < 10:
    ans += 100*(10-N)
print(ans)
from sys import stdin

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

if n < 10:
    print(r + 100 * (10-n))
else:
    print(r)
a = list(map(int, input().split()))
print(a[1] + (10 - min(a[0] , 10)) * 100)
# coding: utf-8

n,r = map(int, raw_input().split())

if n >= 10:
    print r
else:
    print r +  100*(10 - n)
n,r = map(int,input().split())
if n >= 10:
  print(r)
else:
  k = 100 * (10 - n)
  print(r + k)
#2 2919
#22 3051
n,r=map(int,input().split())

ans=r

if n< 10:
  ans=r+100*(10-n)

print(ans)
n, r = map(int, input().split())
if n < 10:
    r+=((10-n)*100)
print(r)
n, r = map(int, input().split())
print(r if n >= 10 else r + 100*(10-n))
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# vim:fenc=utf-8 ff=unix


def solv(N, R):
    if N >= 10:
        return R
    else:
        # R = ans - 100 * (10 - N)
        # ans = R + 100 * (10 - N)
        return R + 100 * (10-N)


if __name__ == "__main__":

    # N R
    #
    N, R = map(int, input().split())
    ans = solv(N, R)

    print(ans)
inputted = list(map(int, input().split()))
N = inputted[0]
R = inputted[1]

internal_rating = lambda R, K: max(R, R + 100 * (10 - K))

answer = internal_rating(R, N)

print(answer)
import sys
input = sys.stdin.readline

N, R = [int(x) for x in input().split()]

if N >= 10:
    print(R)
else:
    print(R + 100 * (10 - N))
N,R = map(int,input().split())
if N <= 10:
    rate = R+(10-N)*100
else:
    rate = R

print(rate)
str = input().split(" ")
n = int(str[0])
r = int(str[1])
if n < 10:
  print(r + 100 * (10 - n))
else:
  print(r)
inputstr = input()
inputsplit = inputstr.split()
N = int(inputsplit[0])
R = int(inputsplit[1])

if N>9:
    hyouji = R
else:
    hyouji = R + 100*(10 - N)

print(hyouji)
n,r=map(int,input().split())
print(r) if n>=10 else  print(r+100*(10-n))
a,b=map(int,input().split())
if a<10:
  print(b+(100*(10-a)))
else:
  print(b)
N,R=map(int,input().split())

if(N>=10):
    print(R)
else:
    print(R+100*(10-N))
n,r=map(int, input().split())
if n<10:
  print(r+100*(10-n))
else:
  print(r)
n,r=map(int,input().split())
if n<10:
    r=r+(100*(10-n))
print(r)
n, r = map(int, input().split())
if n < 10:
    print(r + 100 * (10 - n))
else:
    print(r)
n,r=map(int,input().split())
inn=0
if n<10:
  inn=100*(10-n)
  print(r+inn)
else:
  print(r)
n, r = map(int, input().split())
print(r + 100 * max(10 - n, 0))
N,R = map(int,input().split())

if N > 9:
  print(R)
else:
  R += 100*(10-N)
  print(R)
N,R = list(map(int, input().split()))

if N <= 10:
    print(R+(100*(10-N)))
else:
    print(R)
N,M = map(int, input().split())

if N <= 9:
  print(M + 100*(10 -N))
else:
  print(M)
N,R=map(int,input().split())
if N>=10:
    print (R)
else:
    print (R+100*(10-N))
N,R = map(int,input().split())

if N >= 10:
  print(R)
else:
  print(R+100*(10-N))
N, R = map( int, input().split() )
if N > 10:
    print( R )
else:
    print( R + 100 * ( 10 - N ) )
n,r=map(int,input().split())
rate = 100*(10-n)
if n >= 10:
  print(r)
else:
  print(r+rate)
def strr():
 a=raw_input()
 return a
def sstrr():
 a=raw_input().split()
 return a
def intt():
 a=int(raw_input())
 return a
def iintt():
 a=[int(s) for s in raw_input().split()]
 return a
def nestt(t):
 a=[raw_input().split() for s in range(t)] 
 return a

nr=iintt()
n=nr[0]
r=nr[1]
if n>=10:
 a=r
else:
 a=r+100*(10-n)
print a
N,R=[int(i) for i in input().split()] 

if N < 10:
  R += 100 * (10- N)
  print(R)
else:
  print(R)
N,R=map(int,input().split())
if N<10:
  ans=R+(100*(10-N))
else:
  ans=R
print(ans)
[N,R]=[int(item)for item in input().split()]
print(max(R, R+100*(10-N)))
N, R = map(int, input().split())
if N < 10:
  print(R + 100*(10-N))
else:
  print(R)
N, R = map(int,input().split())
if N >= 10:
  print(R)
else:
  print(R + 100*(10 - N))
n, r = map(int, input().split())
inside = 0

if n >= 10:
    inside = r
else:
    inside = r + 100*(10-n)

print(inside)
N, R = map(int, input().split())
if N >= 10:
  ans = R
else:
  ans = R + 1000 - (100 * N)
print(ans)
n,r=map(int,input().split())
if n>9:
  print(r)
else:
  print(r+100*(10-n))
n,r = map(int ,input().split())

if n>=10:
    print(r)
else:
    print(r+(100*(10-n)))
import sys
from collections import deque, Counter, defaultdict
from fractions import gcd
input = lambda: sys.stdin.readline().rstrip()

def eprint(s):
    sys.stderr.write('DEBUG: {}'.format(s))
    return

def main():
    n, r = map(int, input().split())
    if n>= 10:
        print(r)
    else:
        # r = 100 * (10-n)
        print(r+ 100*(10-n))
    return

if __name__ == '__main__':
    main()
n, r = map(int, input().split())

if n >= 10 :
    ans = r
else :
    ans = r + 100 * (10 - n)

print(ans)
n, r = map(int, input().split())
ans = r

if n<10:
    ans += 100*(10-n)

print(ans)
n,r = map(int,input().split())
rate = 0
 
if n<10:
  rate = r + 100*(10-n)
elif n>=10:
  rate = r
  
print(rate)
n,r = map(int,input().split())
if n<10:
    print(r+(100*(10-n)))
else:
    print(r)
n, r = map(int,input().split())
if n >= 10:
    print(r)
else:
    print(r+100*(10-n))
N, R = map(int,input().split())
if N >= 10:
    print(R)
else:
    print(R + 100*(10 - N))
import sys
sys.setrecursionlimit(10 ** 7)

N, R = map(int, input().split())

if N < 10:
    ans = R + 100 * (10 - N)
else:
    ans = R

print(ans)
N,R=map(int, input().split())

if N>=10:
  ans=R
else:
  ans=R+100*(10-N)
print(ans)
n, r = map(int, input().split())

if n < 10:
    print(r+100*(10-n))
else:
    print(r)
N,R = map(int,input().split())

rating = 0
if N >= 10:
    rating = R
else:
    rating = R + 100 * (10-N)
print(rating)
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))

#################

N,R = LI()

if N>=10:
    print(R)
else:
    print(R+100*(10-N))
k, r = map(int, input().split())

if k >= 10:
    print(r)
else:
    print(r + 100*(10-k))
import math
def I():
  return input()
def II():
  return int(input())
def MII():
  return map(int, input().split())
def LMII():
  return list(map(int, input().split()))

n, r = MII()
print(r+100*max((10-n), 0))
n,r=map(int,input().split());print(100*max(0,10-n)+r)
n,r=map(int,input().split())
r+=0 if n>=10 else 100*(10-n)
print(r)
n, r = map(int, input().split())
if n >= 10:
    print(r)
else:
    print(r+100*(10-n))
N,R = map(int, input().split())


if N>=10:
    print(R)
else:
    print(R+100*(10-N))
def main():
    n,r=[int(i) for i in input().split()]
    if n>=10:
        print(r)
    else:
        print(r+100*(10-n))
if __name__=="__main__":
    main()
n, r = map(int, input().split())
i = 0
if n < 10:
  i = r + 100*(10-n)
else:
  i = r
print(i)
n,r=map(int,input().split())
if n>=10:
  print(r)
else:
  print(int(r+100*(10-n)))
n, r = map(int, input().split())
if n >= 10:
    print(r)
else:
    print(r + (100 * (10 - n)))
N,R=list(map(int,input().split()))
R=R+(10-N)*100 if N<10 else R
print(R)
N,R=map(int,input().split())
if N>=10:print(R)
else:print(R+100*(10-N))
n,r = map(int,input().split())

if n >= 10:
    print(r)
else:
    in_rating = r + 100 * (10-n)
    print(in_rating)
N,R = map(int,input().split())

if (N < 10):
  ans = R + 100 * (10 - N)
else:
  ans = R

print(ans)
n, r = map(int, input().split())
print(r + 100 * (10 - min(n, 10)))
n,r = map(int,input().split())

if n >= 10:
  print(r)
else:
  print(r+100*(10-n))
#!/usr/bin/env python3

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
from copy import deepcopy
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))


n,r = LI()
if n >= 10:
  print(r)
else:
  print(r+100*(10-n))
N,R=map(int,input().split())

if N>9:
    print(R)
else:
    print(R+100*(10-N))
n,r = map(int,input().split())

if n >= 10:
  ans = r
else:
  ans = r + 100*(10-n)
print(ans)
n, r = map(int, input().split())

if n < 10:
    print(r + 100*(10-n))
else:
    print(r)
def contest(N, R):
    if(N > 10):
        return R
    else:
        return R + 100 * (10-N)

if __name__ == "__main__":
    N, R = map(int, input().split())
    print(contest(N, R))
N, R = map(int, input().split())
print(R + 100 * (10-N) * (N<10))
n, r = map(int, input().split())
if n >= 10:
	print(r)
else:
	print(r + 100 * (10 - n))
N,R = map(int,input().split())
 
if N >= 10:
  print(R)
else:
  print(R + 100*(10-N))
input = raw_input
n, r = map(int, input().split(" "))

if n < 10:
    out = r + 100 * (10-n)
else:
    out = r

print(out)
# -*- coding: utf-8 -*-
n, r = map(int,input().split())

if n >= 10:
    print(r)
else:
    print(r + 100 * (10 - n))
n, r = map(int, input().split())
if n <= 10:
  ans = r + 100*(10-n)
else:
  ans = r
print(ans)
N,R = map(int, input().split())

inrate = 0

if N >= 10 :
  inrate = R
else:
  inrate = R + 100*(10-N) 
print(inrate)
N,R=map(int,input().split())
print(R if N>=10 else R+100*(10-N))
N, R = map(int ,input().split())
if N >= 10:
    print(R)
else:
    print(R  + 100 * (10 - N))
N, R = [int(i) for i in input().split()]
print(R if N >= 10 else R+100*(10-N))
N,R = map(int, input().split())

print(R+100*(10-N) if N<10 else R)
N, R = map(int, input().split())

if N >= 10 :
    print(R)
else :
    print(R + 100 * (10 - N))
N,R = map(int,input().split())
if N < 10:
    print(R + 100*(10-N))
else:
    print(R)
n, r = map(int, input().split())
if n >= 10:
  print(r)
else:
  print(r + (10 - n) * 100)
N, R = map(int, input().split())
if N >= 10:
  print(R)
else:
  print(R+100*(10-N))
n,r=map(int,input().split())
if n >= 10:
    print(r)
else:
    print(r + (100 * (10 - n)))
N,R=map(int,input().split())
if N < 10:
  print(R + 100 * (10 - N))
else:
  print(R)
N,K=list(map(int,input().split(' ')))
if N<10:
    print(K+100*(10-N))
else:
    print(K)
n, r = map(int, input().split())

ret = 0
if n >= 10:
    ret = r
else:
    ret = r + 100 * (10 - n)

print("{}".format(ret))
import sys

f = sys.stdin
N, R = map(int, f.readline().split(' '))

I = R

if N < 10:
    I = R + 100 * (10 - N)

print(I)
n, r = map(int, input().split())
if n >= 10:
    print(r)
else:
    print(r + (10-n)*100)
n, r = map(int, input().split())

if n <= 10:
    print(r + (100 * (10 - n)))
else:
    print(r)
n, r = map(int,input().split())

if n >= 10:
    in_rate = r
elif n < 10:
    in_rate = r + 100*(10-n)
    
print(in_rate)
a,b = map(int,input().split())
if a >= 10:
  print(b)
else :
  print(b + ((10-a)*100))
N, R = map(int, input().split())

if N >= 10:
    print(R)
else:
    print(R + 100*(10-N))
#Beginner
N, R = map(int,input().split())
if N <= 10:
    R += 100 * (10-N)
print(R)
n,r=list(map(int,input().split(" ")))
if n > 10:
  print(r)
else:
  print("{}".format(100*(10-n)+r))
n,r = map(int, input().split())
print (100*(10-n)+r) if n < 10 else print (r)
n, r = map(int, input().split())
if n >= 10:
    n = 10
print(r + 100 * (10 - n))
n,r = map(int,input().split())
print((n<10)*(r+100*(10-n)) or r)
N,M = map(int,input().split())
if N > 9:
    print(M)
else:
    print(M + (100 * (10-N)))
N,R = map(int,input().split())

if N<10:
  print(R+100*(10-N))
else:
  print(R)
n,r=map(int,input().split())

if n<10:
    print(r+100*(10-n))
else:
    print(r)
n, r = map(int,input().split())

a = 100*(10-n)
if a >0:
    print(r+a)
else:
    print(r)
k = list(map(int, input().split()))
if k[0] >= 10:
  print(k[1])
else:
  print(100*(10-k[0]) + k[1])
N,R=map(int,input().split())

if N>=10:
    print(R)
else:
    print(R+100*(10-N))
n,r=map(int,input().split())
print(r+100*(10-n) if n<10 else r)
n,r=(int(x) for x in input().split())

if n >= 10:
    rate = r
else:
    rate = r + 100 * (10 - n)

print(rate)
n, r = [int(x) for x  in input().split()]

if n < 10:
  print(r + 100*(10-n))
else:
  print(r)
#s = input().split()
N,R = map(int, input().split())

if N >= 10:
    answer=R
else:
    answer=R+100*(10-N)
print(answer)
n,r = map(int, input().split())
if n >= 10:
    print(r)
else:
    print(r+100*(10-n))
n, r = map(int, input().split())

if n < 10:
    print(r + 100 * (10-n))
else:
    print(r)
[N, R] = list(map(int, input().split()))
if 10 <= N:
  ans = R
else:
  ans = R + 100 * (10 - N)
print(ans)
n, r = map(int, input().split())

if(n >= 10):
  print(r)
else:
  print(r+(100*(10 - n)))
N,R=map(int,input().split())                            # 1行2列

if N < 10:
	print(R + 100 * (10 - N))
else:
	print(R)
n,r=map(int,input().split())
if(n>=10):
  print(r)
else:
  print(r+(100*(10-n)))
N, R = list(map(int, input().split()))
if N >= 10:
	print(R)
else:
	print(100 * (10 - N) + R)
N, R = list(map(int,input().split(" ")))

if N < 10:
  print(R+100*(10-N))
else:
  print(R)
def main():
    K = 0
    N, R = [int(_) for _ in input().split()]
    if N >= 10:
        K = R
    else:
        K = R + 100 * (10 - N) 
    print(K)
main()
N, R = list(map(int, input().split(' ')))
if N >= 10:
    print(R)
else:
    print(R + (100 * (10 - N)))
import itertools


n, r = map(int, input().split())
# p = list(map(int, input().split()))
# s = input().split()
# S = [int(input()) for i in range(int(n))]
i =0
if n < 10:
    i= 100*(10 -n)

print(r+i)
def solve():
    if n>=10:
        return r
    else:
        return r+100*(10-n)


n, r = [int(i) for i in input().split(" ")]
print(solve())
k, n = list(map(int, input().split(' ')))
print(n + 100 * (10 - min(10, k)))
N, R = map(int, input().split())
1 <= N < 100
0 <= R < 4111

if N < 11:
    print(R+100*(10 - N));

else:
    print(R);
n,r=map(int, input().split())
if n >=10:
    print(r)
else:
    print(r+100*(10-n))
n,r = map(int,input().split())

if n < 10:
    print(r + 100*(10-n))
else:
    print(r)