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):
    ans = 0;
    while(x>0):
        ans += x%10;
        x/=10
    return ans

x, y = map(int, raw_input().split())
a1 = ""
b1 = ""
temp = x
while(temp > 8):
    a1 += "8"
    b1 += "1"
    temp-=8

a1 += "9"
b1 += "1"

curr = len(b1)

while(curr < x):
    b1 = "9" + b1
    curr += 9

print a1
print b1