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 = map(int, input().split())

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

Solution (Python):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

n,r = nm()

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

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())

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

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

Solution (Python):
import sys
import math
from collections import deque
from collections import defaultdict

def main():
    n,r = list(map(int,sys.stdin.readline().split()))
    if n>=10:
        ans = r
    else: ans = 100*(10-n)+r
    print(ans)
if __name__ == "__main__":
    main()

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

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

Solution (Python):
times, disp_rate = map(int, input().split())

int_rate = 0


if times < 10:
    
    int_rate = disp_rate + 100 * (10-times)
else:
    int_rate = disp_rate

print(int_rate)

Solution (Python):
from sys import stdin, setrecursionlimit


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


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Solution (Python):
n, r = map(int, input().split())
if n<10:
    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())

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

print(answer)

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

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

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
ns = lambda: stdin.readline().rstrip()
na = lambda: list(map(int, stdin.readline().split()))


N, R = na()


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

Solution (Python):


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

n, r = map(int, input().split())
f(n, 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:
    print(r)
else:
    print(r + 100*(10-n))

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

print(R + 100 * max(0, (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:
    
    rating=100*(10-n)+r
else:
    rating=r
    
print(rating)

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())
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):
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(r+100*(10-n))

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

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

Solution (Python):
import itertools
import math
import fractions
import functools

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(r if 10 <= n else r + 1000 - 100*n)

Solution (Python):
n,r = map(int, raw_input().split(' '))
def f(n,r):
  if n >= 10:
    return r
  else:
    return r + 100 * (10 - n)
print f(n,r)

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

Solution (Python):
import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter

from functools import lru_cache

sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9 + 7
eps = 10**-7


def inp():
    '''
    一つの整数
    '''
    return int(input())


def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split()))


def comb(n, r):
    if n - r < r:
        r = n - r
    res = 1
    for i in range(r):
        res *= (n - i) % mod
        res %= mod
        res *= pow(r - i, mod - 2, mod)
        res %= mod
    return res


n, r = inpl()
print(r + 100 * (10 - min(n, 10)))

Solution (Python):
import sys
input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

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 = 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:
    ans = r
else:
    ans = r + 100*(10-n)
print(ans)

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

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

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

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

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

    print(inner)

main()

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):
import math
import queue
from collections import defaultdict
 
def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def printQueue(q):
	r=qb
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)
def dq():
	return queue.deque()
class UnionFind():
	def __init__(self, n):
		self.n = n
		self.parents = [-1]*n

	def find(self, x): 
		if self.parents[x]<0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]

	def union(self,x,y):
		x = self.find(x)
		y = self.find(y)

		if x==y:
			return

		if self.parents[x]>self.parents[y]:
			x,y = y,x

		self.parents[x]+=self.parents[y]
		self.parents[y]=x

	def size(self,x):
		return -1*self.parents[self.find(x)]

	def same(self,x,y):
		return self.find(x)==self.find(y)

	def members(self,x): 
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i)==root]

	def roots(self):
		return [i for i,x in enumerate(self.parents) if x<0]

	def group_count(self):
		return len(self.roots())

	def all_group_members(self):
		return {r: self.members(r) for r in self.roots()} 
def bitArr(n):
	x = 1
	zero = "0"*n
	ans = []
	ans.append([0]*n)
	for i in range(2**n-1):
		ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
		x+=1
	return ans;
def arrsSum(a1,a2):
	for i in range(len(a1)):
		a1[i]+=a2[i]
	return a1

n,r = readInts()
k=n

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

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

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

Solution (Python):
n,m=map(int,input().split())
if n>=10:
    print(m)
else:
    print(m+(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(_) for _ in 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):

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

Solution (Python):
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

Solution (Python):
N, R = list(map(int, input().split()))
if N < 10:
    print(R + 1000 - 100*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)
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:
    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 = list(map(int, input().split()))

if n < 10:
    inside_score = r + 100*(10 - n)
    print(inside_score)
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 =(int(x) for x in input().split())
print(R if N>= 10 else R + 100 * (10 - N))

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

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

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

Solution (Python):
def main():
    strA = input()
    listA = strA.split(" ")

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

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

    print(nRate)

if __name__ == '__main__':
    main()

Solution (Python):
def main():
    strA = input()
    listA = strA.split(" ")

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

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

    print(nRate)

if __name__ == '__main__':
    main()

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 = 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):
import fileinput

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

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

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

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

if __name__ == '__main__':

    ABC_156_A()

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=map(int,input().split())
if n<10:
  print(int(r+100*(10-n)))
else:
  print(r)

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

Solution (Python):

import sys, re
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

n, r= MAP()

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

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())

ans = 0

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

print(ans)

Solution (Python):
N,R = [int(s) for s 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)
elif n<10:
  print(r+(100*(10-n)))

Solution (Python):
import sys










stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18



n,r = map(int, stdin.readline().rstrip().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(R+100*(10-min(N, 10)))

Solution (Python):

"""
Created on Thu May  7 21:55:53 2020

@author: shinba
"""

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:
  inter_r = 100 * (10-N)
  print(R + inter_r)

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

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

Solution (Python):
from sys import stdin


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


if __name__ == "__main__":
    main()

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

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

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(str(r+100*(10-n))+"\n")
else:
  print(str(r)+"\n")

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

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(100 * (10 - n) + r)
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):


N, R = map(int, input().split())
print(R if 10 <= N 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):
N,R = map(int,input().split())
if N >= 10 :
    print(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())
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):
def main():
    import sys
    input = sys.stdin.readline

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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  
def Is(): return map(int, input().split())  
def LI(): return list(map(int, input().split()))  
def TI(): return tuple(map(int, input().split()))  
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  
def LS(): return list(input())  
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

n, r = Is()
if n < 10:
    print(r+100*(10-n))
    exit()
print(r)

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):
N, R = map(int, input().split())
if N < 10:
    ans = R + 100 * (10 - N)
else:
    ans = R
print(ans)

Solution (Python):

import sys


def solve(N: int, R: int):
    if N >= 10:
        print(R)
    if N < 10:
        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):


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

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

print(ans)

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n,r = [int(i) for i in readline().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+(10- N)*100)

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+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:
    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 = [int(_) for _ 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:
  ans=R
else:
  ans=R+100*(10-N)
print(ans)

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):
N, R = map(int, input().split())

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

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

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

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:
    rate=r
else:
    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):
N, R = map(int, input().split())
print(R + 100*(10-N)) if N < 10 else print(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 + 100 * (10 - n))
else:
    print(r)

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

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

Solution (Python):
N,R = map(int,input().split())
print(R) if N>=10 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())
ans = r if n > 10 else 100 * (10 - n) + r
print(ans)

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

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

print(solve())

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:
  rate = R
else:
  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):
N,R = map(int,input().split())
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:
    print(R)
else:
    print(R + 1000 - 100 * N)

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):
N, R = map(int, input().split())

if N >= 10:
    print(R)

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

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N, R = lr()
answer = R
if N < 10:
    answer += (10-N) * 100
print(answer)

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

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

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

Solution (Python):

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

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())
if N >= 10:
    print(R)
else:
    print(R+100*(10-N))

Solution (Python):
def input_num():
	ls = input().strip().split(" ")
	return [int(e) for e in ls]

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

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

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

tmp = 100*(10-N)

if tmp >= 0:
  print(100*(10-N) + R)
else:
  print(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:
    a = r + (100 * (10-n))
    print(a)

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

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

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

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

print(x)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


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


if __name__ == '__main__':
    solve()

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


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


if __name__ == '__main__':
    solve()

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(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,M = map(int,input().split())
if N > 9:
    print(M)
else:
    print(M + (100 * (10-N)))

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

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

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

Solution (Python):
il = input().split()
N = int(il[0])
R = int(il[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:
  print(100*(10-N)+R)

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 = 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)
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(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(r+100*(10-n) if n<10 else 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:
    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:
    k = 100*(10-n)
    s = r + k
else:
    s = r
print(s)

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

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

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

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)
else:
    print(r + (100*(10-n)))

Solution (Python):
import sys
input = sys.stdin.readline
input = sys.stdin.buffer.readline

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))


def main():
    N,R = MI()
    ans = R + 100*(10-N)

    if N<10:
        print(ans)
    else:
        print(R)



if __name__ == "__main__":
	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:
	r = 100*(10-n)+r
print(r)

Solution (Python):
N, R = map(int, input().split())
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 + 100*(10 - N) )
else :
    print( R )

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

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

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

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 + 1000 - 100 * N)

Solution (Python):
N, R = map(int, input().split())
print(R) if N >= 10 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 = 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 10<=N:
  print(R)
else:
  a=R+100*(10-N)
  print(a)