import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
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))) import sys, bisect, math, itertools, heapq, collections sys bisect math itertools heapq collections from operator import itemgetter from functools import lru_cache sys.setrecursionlimit(10**8) sys.setrecursionlimit sys setrecursionlimit 10**8 10 8 input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline INF = float('inf') INF float('inf') float 'inf' mod = 10**9 + 7 mod 10**9 + 7 10**9 10 9 7 eps = 10**-7 eps 10**-7 10 -7 def inp():
    '''
    一つの整数
    '''
    return int(input()) inp '''
    一つの整数
    ''' return int(input()) int(input()) int input() input def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split())) inpl '''
    一行に複数の整数
    ''' return list(map(int, input().split())) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () 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 comb if n - r < r:
        r = n - r
     n - r < r n - r n r r r = n - r r n - r n r res = 1 res 1 for i in range(r):
        res *= (n - i) % mod
        res %= mod
        res *= pow(r - i, mod - 2, mod)
        res %= mod
     i range(r) range r res *= (n - i) % mod res (n - i) % mod n - i n i mod res %= mod res mod res *= pow(r - i, mod - 2, mod) res pow(r - i, mod - 2, mod) pow r - i r i mod - 2 mod 2 mod res %= mod res mod return res res n n r r n, r = inpl() n inpl() inpl r print(r + 100 * (10 - min(n, 10))) print r + 100 * (10 - min(n, 10)) r 100 * (10 - min(n, 10)) 100 10 - min(n, 10) 10 min(n, 10) min n 10 r = inpl() inpl() r INF = float('inf') float('inf') INF eps = 10**-7 10**-7 eps def inp():
    '''
    一つの整数
    '''
    return int(input()) def inp():
    '''
    一つの整数
    '''
    return int(input()) inp n, r = inpl() inpl() n def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split())) def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split())) inpl 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 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 comb mod = 10**9 + 7 10**9 + 7 mod input = sys.stdin.readline sys.stdin.readline input
import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
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)))
