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:
def sum_digits(n):
    s = 0
    while n:
        s += n % 10
        n //= 10
    return s

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



lel = n;
first = 0;
count = 0;
while(lel>9):
    first = first*10+9;
    lel = lel - 9;
    count = count+1
if(lel):
    first = first*10 + lel;
    count = count+1

lel2 = m;
second=0;
while(lel2>9):
    second = second*10+9;
    lel2 = lel2 - 9;
    count = count+1
if(lel2):
    second = second*10 + lel2;
    count = count+1

left = (second-1)*(10**count)
right = (10**count - first)
    
namma = sum_digits(left) + sum_digits(right)
finale = left + right
if( namma < n):
    k = n-namma
    unc=0
    cnt=0
    while(k>0):
        unc = unc*10 + 9
        cnt = cnt + 1
        k = k-9 
    unc = unc*10 + 9
    cnt = cnt + 1
    finale = (second-1)* (10**(count+cnt)) + (unc)*(10**count) + right
    
    
    
print(first, finale )