Problem: Let s(x) be sum of digits in decimal representation of positive integer x. Given two integers n and m, find some positive integers a and b such that 

  * s(a) ≥ n, 
  * s(b) ≥ n, 
  * s(a + b) ≤ m. 

Input

The only line of input contain two integers n and m (1 ≤ n, m ≤ 1129).

Output

Print two lines, one for decimal representation of a and one for decimal representation of b. Both numbers must not contain leading zeros and must have length no more than 2230.

Examples

Input

6 5


Output

6 
7


Input

8 16


Output

35 
53

Note

In the first sample, we have n = 6 and m = 5. One valid solution is a = 6, b = 7. Indeed, we have s(a) = 6 ≥ n and s(b) = 7 ≥ n, and also s(a + b) = s(13) = 4 ≤ m.

Solution (in PYTHON3):

Solution:
n, m = input().split()
n, m = int(n), int(m)


def list2int(lst):
    '''convert list to int'''
    return int(''.join(str(element) for element in lst))


def int2list(integer):
    '''convert int to list'''
    lst = []

    lst.append(integer % 10)
    integer //= 10
    while(integer != 0):
        lst.append(integer % 10)
        integer //= 10
    return lst


# the smallest number which variable 'a' can take
# a >= [9] * n//9 + [n%9]
a = list2int([9] * (n//9) + [n % 9])

# c = a + b
# s(c) must be smaller or equal to m where 1<=m<=1129.
# moreover, c must have length no more than 2230
# so here we assign c to [1] + [0] * 2229.
# with that, we can assure s(a+b) is equal to 1 and always
# satisfy the condition s(a+b) < m
c = list2int([1] + [0] * 2229)

# Even with the largest value of n (=1129), variable 'a'
# is just have 126 digits. While variable 'c' have 2230 digits,
# the result of c-a will have at least about 2104 digits. As a result,
# we are sure that the condition s(b) >= n is satisfied.
b = c - a

print(a)
print(b)