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 PYTHON):

Solution:
n, m = [int(i) for i in raw_input().split()]

a = ''
n1 = n
while (n1 > 9):
    a += '9'
    n1 -= 9
a += str(n1)

b = ''
for i in xrange(len(a) - 1):
    b += '0'
b += str(10 - n1)

n2 = n - (10 - n1)
b2 = ''
while n2 > 0:
    b2 += '9'
    n2 -= 9

print a + ' ' +  b2 + b