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 s(x):
    res = 0
    for c in x:
        res += int(c)
    return res
   
def generate(n, l):
    res = ""
    nines = n/9
    for i in range(nines):
        res += '9'
    res += str(n-9*nines)
    for i in range(len(res), l):
        res += '0'
    return res    
    
n = 0
m = 0
line = raw_input()
line = line.split();
n = int(line[0])
m = int(line[1])

a = generate(n, 1+n/9)
c = generate(m, min(2230, 2*len(a)))
b = str(int(c)-int(a))

print a+" "+b