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:
def check(a):
    cnt=0
    while a>0:
        cnt+=(a%10)
        a/=10
    return cnt
n,m=map(int,raw_input().split())
s=0
c=m
while c>0:
    t=min(9,c)
    s=s*10
    s+=t
    c-=t
c=n
a=0
while c>0:
    t=min(9,c)
    a*=10
    a+=t
    c-=t
b=s-a
while check(b)<n:
    s=s*10
    b=s-a
print a
print b