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 JAVA):

Solution:
import java.util.*;
public class MyClass {
    public static void main(String args[]) 
    {
        Scanner sc=new Scanner (System.in);
       int n=sc.nextInt();
       int m=sc.nextInt();
       int len=0;
       String ans1="";
       int nc=n;
      while(n>=0)
      {
          ans1=ans1+"5";
          n=n-5;
          len++;
      }
   // System.out.println((len-1)*4+5);
      while(((len-1)*4+5)<nc)
      {
          
          ans1=ans1+"5";
          len++;
      }
     //  System.out.println((len-1)*4+5);
      int l=ans1.length();
      //System.out.println(l);
      String ans2="";
      int c=0;
      
      for(int i=l-1;i>=0;i-- )
      {
          int d=10-(ans1.charAt(i)-48)-c;
          ans2=d+ans2;
          c=1;
          
          
      }
      
      System.out.println(ans1);
      System.out.println(ans2);
        
    }
}