489_C. Given Length and Sum of Digits..._33156
You have a positive integer m and a non-negative integer s. Your task is to find the smallest and the largest of the numbers that have length m and sum of digits s. The required numbers should be non-negative integers written in the decimal base without leading zeroes.

Input

The single line of the input contains a pair of integers m, s (1 ≤ m ≤ 100, 0 ≤ s ≤ 900) — the length and the sum of the digits of the required numbers.

Output

In the output print the pair of the required non-negative integer numbers — first the minimum possible number, then — the maximum possible number. If no numbers satisfying conditions required exist, print the pair of numbers "-1 -1" (without the quotes).

Examples

Input

2 15


Output

69 96


Input

3 0


Output

-1 -1
def maximum(n,s):
    l,su="",s
    for i in xrange(n):
        if su<9:
            l+=str(su)
            su=0
        else:
            l+="9"
            su-=9
    return l
def minimum(n,s):
    l,su=[],s-1
    if n==1:
        return s
    for i in xrange(n-1):
        if su<9:
            l.append(su)
            su=0
        else:
            l.append(9)
            su-=9
    l.append(su+1)
    l.reverse()
    ans = ""
    for i in l:
        ans += str(i)
    return ans
n,s=map(int,raw_input().split())
if 0<s<=n*9:
    print minimum(n,s),maximum(n,s)
elif n==1 and 0<=s<=9:
    print s,s
else:
    print "-1 -1"