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.
n,m = map(int, input().split())

# x = n
# ost = 0
# k = 2
# while x >= 10:
#     x = n // k
#     ost = n % k
#     k = k + 1
# k = k - 1
#


def getCh(n):
    k = n // 5
    ost = n % 5

    st = ""
    for i in range(k):
        st += str(5)

    if ost != 0:
        st = str(ost) + st
    return st

#-----------------------

st1 = getCh(n)
max = "1000000000000000000000000000000000000000000000000000000000000000000000000000000"
for i in range(len(st1)):
    max += "0"
st2 = str(int(max) - int(st1))

# f = open("output.txt", "w")
# f.write(st1+"\n")
# f.write(st2)
# f.close()

print(st1)
print(st2)

# sum = 0
# for i in range(len(st1)):
#    sum += int(st1[i])
# print(sum)