489_C. Given Length and Sum of Digits..._33159
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
// CODE PRODUCED UNDER ACE PRODUCTIONS 

import java.util.*;
public class Ace
{
    public static void main(String[] args)
    {
        Scanner sc=new Scanner(System.in);
       int m,s,i,j,k,d,p=0;
       m=sc.nextInt();
       s=sc.nextInt();
       int[] ar=new int[m];
       int[] br=new int[m];
       k=m*9;
    if(m==1&&s==0) System.out.print("0 0");
       else  if(s>0&&s<=k)
      {
          for(i=0;i<m;i++)
       {
         p=9;
         if(p<s)
         {
              ar[i]=p; br[i]=p;
             s=s-p;
         }
         else if(p>=s)
         {
             ar[i]=s; br[i]=s;
             s=0;
             break;
         }
       }
       
       if(br[m-1]==0)
       {
           for(i=m-1;i>=0;i--)
           {
               if(br[i]!=0)
               {br[m-1]++;
           br[i]--;
               break;
               }
           }
       }
       for(i=m-1;i>=0;i--)
          System.out.print(br[i]); 
       System.out.print(" ");
       for(i=0;i<m;i++)
           System.out.print(+ar[i]);
      }
      else System.out.print("-1 -1");
      
    }  
}