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 javafx.util.Pair;
import org.omg.Messaging.SYNC_WITH_TRANSPORT;

import java.lang.management.MemoryUsage;
import java.math.BigInteger;
import java.util.*;
import java.io.*;
import java.util.Collections;

public class Main {

    public static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
    public static PrintWriter pw=new PrintWriter(System.out);
    public static void main(String[] args) throws IOException {
        // TODO Auto-generated method stub
        Scanner S = new Scanner(System.in);
       int a=S.nextInt(),b=S.nextInt();
       int len=(a/9)+1;
       String val="";
        for (int i = 0; i < len; i++) {
            val+='9';
        }
        String lav="";
        for (int i = 0; i < len-1; i++) {
            lav+='0';
        }
        lav+='1';
        System.out.println(val+" "+val+lav);

    }
}