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.io.IOException;
import java.math.BigInteger;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) throws IOException {
        try {
            Scanner sc = new Scanner(System.in);
            int n, m;
            n = sc.nextInt();
            m = sc.nextInt();
            String s = "";
            for ( int i = 0; i < n; i++ ) {
                s += '1';
            }
            BigInteger s1 = new BigInteger(s);
            s = "";
            s += '1';
            for ( int i = 0; i < n; i++ ) {
                s += '0';
            }
            BigInteger s2 = new BigInteger(s);
            System.out.println(s1 + " " + (s2.subtract(s1)));


        }catch (Exception e) {
            return;
        }
    }
}