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.
//package ContestAIMTech;

import java.io.PrintWriter;
import java.util.Scanner;

public class aimB {
    public static Scanner enter = new Scanner(System.in);
    public static PrintWriter out = new PrintWriter(System.out);
    public static void main(String[] args) {
        enter.nextInt();
        enter.nextInt();
        int[] mass1=new int[126];
        for (int i = 0; i <mass1.length ; i++) {
            mass1[i]=9;
        }
        int[] mass2=new int[252];
        mass2[251]=1;
        for (int i = 0; i <mass1.length ; i++) {
            mass2[i]=9;
        }

        for (int i = 0; i <mass1.length ; i++) {
            out.print(mass1[i]);
        }
        out.println();
        for (int i = 0; i <mass2.length ; i++) {
            out.print(mass2[i]);
        }
        out.close();
    }
}
