Problem:
 Score : 100 points    Problem Statement Takahashi is a member of a programming competition site, ButCoder .  Each member of ButCoder is assigned two values: Inner Rating and Displayed Rating .  The Displayed Rating of a member is equal to their Inner Rating if the member has participated in 10 or more contests. Otherwise, the Displayed Rating will be their Inner Rating minus 100 \times (10 - K) when the member has participated in K contests.  Takahashi has participated in N contests, and his Displayed Rating is R . Find his Inner Rating.      Constraints  All values in input are integers.  1 \leq N \leq 100  0 \leq R \leq 4111         Input Input is given from Standard Input in the following format:  N  R       Output Print his Inner Rating.        Sample Input 1 2 2919      Sample Output 1 3719  Takahashi has participated in 2 contests, which is less than 10 , so his Displayed Rating is his Inner Rating minus 100 \times (10 - 2) = 800 .  Thus, Takahashi's Inner Rating is 2919 + 800 = 3719 .       Sample Input 2 22 3051      Sample Output 2 3051

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

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

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

Solution (Python):
N, R = list(map(int,input().split()))
if N < 10:
    print("{}".format(R + (100 * (10 - N))))
else:
    print(R)

Solution (Python):
x = list(map(int,input().split(" ")))
n = x[0]
r = x[1]

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

Solution (Python):
l1 = input()
l1 = l1.split()
N = int(l1[0])
R = int(l1[1])

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

print(ans)

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

Solution (Python):
N, R = map(int, input().split())

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

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

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

Solution (Python):

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

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


print(ans)

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

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

Solution (Python):
N, R = map(int, input().split())

if N >= 10:
    print(R)

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

Solution (Python):
N, R = map(int, input().split())
print(R + 100*(max(10-N, 0)))

Solution (Python):
N, R = map(int, input().split())

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

Solution (Python):
from sys import stdin
n, r = [int(x) for x in stdin.readline().rstrip().split()]



rate = r

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

print(rate)

Solution (Python):
n, r = map(int, input().split())

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

Solution (Python):
def inner_rate(num_participate, outer_rate):
    if(num_participate >= 10):
        return outer_rate
    else:
        return outer_rate + 100 * (10 - num_participate)

if __name__ == '__main__':
  num_participate, outer_rate = input().split()
  num_participate = int(num_participate)
  outer_rate = int(outer_rate)
  
  print(inner_rate(num_participate, outer_rate))

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

Solution (Python):


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


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

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

Solution (Python):

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

res = 0
if n >= 10:
    res = r

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

print(res)

Solution (Python):
N,R = map(int,input().split())

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

Solution (Python):
n, r = map(int, input().split())

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

Solution (Python):
a = input().split()
a=[int(i) for i in a]
n,r=a[0],a[1]
if n>=10:
    b=r
else:
    b=r+1000-100*n
print(b)

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

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

Solution (Python):
a, b = map(int,input().split())

if a >= 10:
  print(b)
else:
  print(b+100*(10-a))

Solution (Python):
import sys
n,r = list(map(int, input().split()))
if n >= 10:
    print(r)
else:
    print(r + 100*(10-n))

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

Solution (Python):
N,R = input().split()

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

Solution (Python):
N, R = map(int, input().split())

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

Solution (Python):
def solve():
    N, M = map(int, input().split())
    
    if N <= 10:
        return 100 * (10-N) + M
    else:
        return M

print(solve())

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

Solution (Python):
a = list(map(int, input().split()))
print(a[1] + 100 * max(0, 10 - a[0]))

Solution (Python):


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

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

Solution (Python):
N, R = map(int, input().split())

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

Solution (Python):
n, r = map(int, input().split())
print(max(r, r + 100 * (10 - n)))

Solution (Python):
n,r= [int(i) for i in input().split()]
t = 0
if n < 10:
    t = 10-n
    
print(r+100*t)

Solution (Python):
N, R = map(int, input().split())

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

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

Solution (Python):
n,r = (int(i) for i in input().split())

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

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

Solution (Python):



import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    N, R = i2nn()
    if N < 10:
        print(R + 100 * (10 - N))
    else:
        print(R)
    return

main()

Solution (Python):
i = input().split()
n = int(i[0])
r = int(i[1])

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

Solution (Python):

import sys
read = sys.stdin.readline


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_matrix(H):
    '''
    H is number of rows
    '''
    return [list(map(int, read().split())) for _ in range(H)]


def read_map(H):
    '''
    H is number of rows
    文字列で与えられた盤面を読み取る用
    '''
    return [read()[:-1] for _ in range(H)]


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H, n_cols):
    '''
    H is number of rows
    n_cols is number of cols

    A列、B列が与えられるようなとき
    '''
    ret = [[] for _ in range(n_cols)]
    for _ in range(H):
        tmp = list(map(int, read().split()))
        for col in range(n_cols):
            ret[col].append(tmp[col])

    return ret


N, R = read_ints()

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

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

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

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

solve()

Solution (Python):


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

if __name__ == '__main__':
  main()

Solution (Python):




import sys
from fractions import gcd
from itertools import groupby as gb
from itertools import permutations as perm
from itertools import combinations as comb
from collections import Counter as C
from collections import defaultdict as dd
sys.setrecursionlimit(10**5)
def y(f):
    if f:
        print('Yes')
    else:
        print('No')
def Y(f):
    if f:
        print('YES')
    else:
        print('NO')
def Z(f):
    if f:
        print('Yay!')
    else:
        print(':(')
def ispow(n):
    if int(n**.5)**2==n:
        return True
    return False

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

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

if N >= 10:
    print(R)
elif N < 10:
    K = R + (100 * (10 - N))
    print(K)

Solution (Python):
if __name__ == '__main__':
    s = input().split(" ")
    n = int(s[0])
    r = int(s[1])
    if n >= 10:
        print(r)
    else:
        print(100 * (10 - n) + r)

Solution (Python):
n, r = map(int, input().split())

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

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

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

ans = R + 100 * max(10 - N, 0)
print(ans)

Solution (Python):
input= list( map(int,input().split()) )
n = input[0]
r=  input[1]

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

Solution (Python):
num=[int(w) for w in input().split()]

if num[0]<10:
    print(num[1]+100*(10-num[0]))
else:
    print(num[1])

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

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

Solution (Python):
N, R=map(int,input().split())

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

Solution (Python):
n,r = map(int,input().split())

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

Solution (Python):
a,b = map(int,input().split())
if a<10:
  print(b+100*(10-a))
else:
  print(b)

Solution (Python):
N, R = map(int, input().split())

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

Solution (Python):
n,r = map(int,input().split())
ans = 0


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

print(ans)

Solution (Python):

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

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

Solution (Python):
n, r = map(int, input().split())
print(r + (100*max(10 - n, 0)))

Solution (Python):
a = list(map(int, input().split()))

if a[0] >= 10:
    print(a[1])
else:
    print(a[1] + 100 * (10 - a[0]))

Solution (Python):
inp = input()
N = inp.split()[0]
R = inp.split()[1]

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

Solution (Python):
N, R = map(int, input().split())

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

Solution (Python):
N, R = map(int, input().split())
x = 0

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

print(x)

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

Solution (Python):
N,R = map(int,input().split())
if N > 10:
    print(R)
elif N <= 10:
    a = 100*(10-N)
    print(R+a)

Solution (Python):
def main():
  N,R = map(int, input().split())

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

if __name__ == '__main__':
  main()

Solution (Python):
import itertools


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



i =0
if n < 10:
    i= 100*(10 -n)

print(r+i)

Solution (Python):
N, R = map(int, input().split())

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

Solution (Python):
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

n, r = na()

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

Solution (Python):
K, R = [int(n) for n in input().split()]

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

Solution (Python):
N,R=(int(x) for x in input().split())
if N >= 10:
        a = R
        print(a)
else:
        a = R + (100*(10-N))
        print(a)

Solution (Python):
N,R = map(int,input().split())

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

Solution (Python):
n,r = map(int,input().split())

if n >= 10:
  print(r)

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

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

Solution (Python):
n, r = map(int, input().split())

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

Solution (Python):
def main():
  n, r = map(int,input().split())
  n = min(n, 10)
  ans = r + 1000 - 100*n
  print(ans)
main()

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

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

Solution (Python):
N, R = map(int,input().split())

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

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

Solution (Python):
N, R = [int(_) for _ in input().split()]
ans = 0
if N >= 10:
    ans = R
else:
    ans = R + 100 * (10 - N)

print(ans)

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

Solution (Python):
N, R = map(int, input().split())

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

print(ans)

Solution (Python):
number_list = [int(i) for i in input().split()]

if number_list[0] >= 10:
    inner_rate = number_list[1]
else:
    inner_rate = number_list[1] + (100*(10-number_list[0]))
print(inner_rate)

Solution (Python):
a = list(map(int, input().split()))


if(a[0] >= 10):
    print(a[1])
else:
    print(a[1]+(100*(10-a[0])))

Solution (Python):
input_arr = input().split(" ")
n = int(input_arr[0])
r = int(input_arr[1])

ans = 0

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

print(ans)

Solution (Python):


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

point = 0

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

print(point)

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

Solution (Python):
N,R = map(int,input().split())

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

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

Solution (Python):
n,r=map(int,input().split())

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

Solution (Python):
n, display_rating = list(map(int, input().split(" ")))

if n < 10:
  a = 100 * (10 - n)
else:
  a = 0
print(display_rating + a)

Solution (Python):

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

Solution (Python):
n, r = map(int, input().split())

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    N, R = map(int,input().split())
    if N >= 10:
        print(R)
    elif N < 10:
        print(R + 100 * (10 - N))

if __name__ == "__main__":
    main()

Solution (Python):
list = input().split()
N = int(list[0])
R = int(list[1])

rate = 0


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

print(rate)

Solution (Python):
a,b=map(int,input().split())

if a>=10:
    print(b)
else:
    print(b+100*(10-a))

Solution (Python):
line = input().split(" ")
N, R = int(line[0]), int(line[1])

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

print(ans)

Solution (Python):
N,R = map(int,input().split())

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

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

Solution (Python):
n,r = map(int,input().split())

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

Solution (Python):


stdin = open(0)


N,R = map(int, stdin.read().split())
if N >= 10:
    answer = R
else:
    answer = R + 100 * (10-N)


print(answer)

Solution (Python):
a, b = input().split()
if int(a) <= 9:
  ans = int(b) + 100 * (10 - int(a))
  print(ans)
else:
  print(b)

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

Solution (Python):


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

ir = 0

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

print(ir)

Solution (Python):


if __name__ == "__main__":
    N, R = map(int, input().split())

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

Solution (Python):
n, r = map(int, open(0).read().split())

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

Solution (Python):
N,R=map(int,input().split())

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

Solution (Python):
N, R = input().split()
N = int(N)
R = int(R)

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

Solution (Python):
N,R=map(int, input().split())

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

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

Solution (Python):

data = list(map(int, input().split()))
k = data[0]
r = data[1]

if k >= 10:
    print(r)
else:
    inner_rate = r + (100*(10-k))
    print(inner_rate)

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

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

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

Solution (Python):




from collections import defaultdict

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

ans = 0

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

print(ans)

Solution (Python):
N, R = map(int, input().split())

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

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

Solution (Python):
n, r = map(int, input().split())

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

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

Solution (Python):
N,K=list(map(int,input().split(' ')))
if N<10:
    print(K+100*(10-N))
else:
    print(K)

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

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

Solution (Python):
n, r = map(int, input().split())

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

Solution (Python):
n, r =list(map(int,input().split()))

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

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

Solution (Python):
N, R = map(int, input().split())

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

print(ans)

Solution (Python):

n,r=(int(x) for x in input().split())

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

Solution (Python):
A = list(map(int, input().split()))
if A[0] <= 10:
  rate = 100 * (10 - A[0])
  inner_rate = A[1] + rate
  print(inner_rate)
else:
  print(A[1])

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

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

print(rate)

Solution (Python):
line = input().rstrip().split(' ')
n = int(line[0])
k = int(line[1])

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

Solution (Python):
N, I=input().split()
ans=I

if int(N)<10:
  ans=int(I)+100*(10-int(N))
  
print(ans)

Solution (Python):
n , k = map(int, input().split(" "))
print(k) if n >= 10 else print(k+(100*(10-n)))

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

Solution (Python):
n,r = map(int, input().split())


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

print(ans)

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

Solution (Python):
N,R = map(int,input().split())

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

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

Solution (Python):
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

Solution (Python):


import sys


def main():
    input = sys.stdin.readline
    N, R = map(int, input().split())
    if N >= 10:
        rate = R
    else:
        rate = R + 100 * (10 - N)
    print(rate)


if __name__ == "__main__":
    main()

Solution (Python):
n,r=map(int,input().split())


print(r+100*max(10-n,0))

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

Solution (Python):
N, R = map(int, input().split())

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

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

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

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

Solution (Python):
N, R = map(int, input().split())

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

Solution (Python):
a = input().split()
if int(a[0]) > 10:
    print(int(a[1]))
else:
    print(int(a[1]) + 100*(10 - int(a[0])))

Solution (Python):
N,R=map(int,input().split())
print(R+max(0,100*(10-N)))

Solution (Python):
s = input().split()
n = int(s[0])
r = int(s[1])

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

Solution (Python):

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

print(100 * (10 - N) + R if N < 10 else R)

Solution (Python):
N,R = map(int,input().split())

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

Solution (Python):
N, R = map(int, input().split())

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

Solution (Python):
a,b=map(int, input().split())
if(a>=10):
    print(b)
else:
    print((100*(10-int(a))+int(b)))

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

Solution (Python):
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()

Solution (Python):

n, r = (int(x) for x in input().split())

ans = ''

if 10 <= n :

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

print(ans)

Solution (Python):
a, b = map(int, input().split())

if a < 10:
  print(b+(100*(10-a)))
else:
  print(b)

Solution (Python):
N, R = map(int, input().split())

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

Solution (Python):
a,b = map(int,input().split())
if a < 10:
    print(b+(10-a)*100)
else:
    print(b)

Solution (Python):
N, R = map(int, input().split())

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

print(n)

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

print(i)

Solution (Python):

import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


def solve(N: int, R: int):
    if N >= 10:
        print(R)
    else:
        print(R+100*(10-N))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    R = int(next(tokens))  
    solve(N, R)

if __name__ == '__main__':
    main()

Solution (Python):
joint, rating = map(int, input().split())
if joint >= 10:
    print(rating)
else:
    displayed_rating = 100 * (10 - joint) + rating
    print(displayed_rating)

Solution (Python):
S = input().split(" ")
N = int(S[0])
R = int(S[1])

def calculate(n,r):
    if n >= 10:
        return r
    else:
        return r + (10 - n) * 100


result = calculate(N,R)
print(result)

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

Solution (Python):
n, r = list(map(int, input().split()))

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

Solution (Python):
NR = input().split()
N = int(NR[0])
R = int(NR[1])

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

Solution (Python):
N,R = map(int, input().split())

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

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

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

Solution (Python):
n,r=map(int,input().split())

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

Solution (Python):
n, r = list(map(int, input().split(' ')))

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

Solution (Python):
s = input().split(" ")

N=int(s[0])
R=int(s[1])

ans=R

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

Solution (Python):
n, r = map(int, input().split())

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

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

Solution (Python):
s = input().split()
n = int(s[0])
r = int(s[1])

if n > 9:
  print(r)
else:
  de = (10 - n) * 100
  print(r + de)

Solution (Python):
n = list(map(int, input().split()))
count, rate = n[0], n[1]

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

print(rate)

Solution (Python):
i = list(map(int, input().split()))
if i[0]>9:
    print(i[1])
else:
    print(i[1]+1000-100*i[0])

Solution (Python):
def I(): return int(input())
def MI(): return map(int, input().split())
def LMI(): return list(map(int, input().split()))


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

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

Solution (Python):
input_line = input()
NR = input_line.split(" ")

N = int(NR[0])
R = int(NR[1])
result = 0

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

print(result)

Solution (Python):
n, r = map(int, input().split())

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

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

Solution (Python):
n,r=map(int,input().split())
print([r+100*(10-n),r][n>9])

Solution (Python):
n, r = map(int, input().split())

if n >= 10:
    print(r)

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

Solution (Python):
first_line = [int(x) for x in input().split(" ")]

if first_line[0] >= 10:
    print(first_line[1])
else:
    print(first_line[1] + 100*(10-first_line[0]))

Solution (Python):
[N,R] = list(map(int,input().split()))
if N>=10:
    I=R  
    
else:
    I=R+100*(10-N)
print(I)

Solution (Python):
N,R = map(int, input().split())

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

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

Solution (Python):
n, r = map(int,input().split())

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

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

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

Solution (Python):
n, r = map(int, input().split())

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

Solution (Python):
n,r = map(int,input().split())

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

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

Solution (Python):
list=input().split()
if int(list[0])>=10:
  print(int(list[1]))

else:
  print(int(list[1])+100*(10-int(list[0])))

Solution (Python):
n, r = map(int, input().split(" "))

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

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

Solution (Python):
n, r  = map(int, input().split())

ans = 0
ans = r + 100 * max(10-n, 0)
print(ans)

Solution (Python):
N,R=input().split()
N=int(N)
R=int(R)

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

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

Solution (Python):
s=input().split()
num=int(s[0])
r=int(s[1])
if num >= 10:
  print(r)
else:
  print(r+100*(10-num))

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

Solution (Python):
N, R = map(int, input().split())

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

Solution (Python):
X,Y = map(int,input().split())

a=max(0,10-X)
print(Y+100*a)

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

Solution (Python):


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

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

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

Solution (Python):
n, r = map(int, input().split())

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

Solution (Python):


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

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

Solution (Python):
import sys
n, r = [int(x) for x in input().split()]
if n >= 10:
    print(r)
else:
    print(r + 100 * (10 - n))

Solution (Python):
n, r = map(int, input().split())

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

Solution (Python):
n, r = map(int, input().split())

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

print(rate)

Solution (Python):
list = input().split()
N = int(list[0])
R = int(list[1])
X = 0
if N >= 10:
  X = R
else:
  X = R + 100*(10 - N)
print(X)

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

Solution (Python):
N, R = map(int, input().split())

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

Solution (Python):
a, b = map(int, input().split())
if(a >= 10):print(b)
else:print(b + 100*(10-a))

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