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.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;
import java.util.*;
import java.math.BigInteger;

public class Main {

  public static void main(String[] args) throws Exception {
			
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
    
    StringTokenizer st = new StringTokenizer(br.readLine());
    int n = Integer.parseInt(st.nextToken());
    int m = Integer.parseInt(st.nextToken());
    int k = (n / 9) + 1;
    StringBuilder sb = new StringBuilder();
    for(int i = 0; i < k; i++) {
        sb.append(9 + "");
    }
    BigInteger bigb = new BigInteger(sb.toString());

    for(int i = 0; i < k-1; i++) {
        sb.append(""+0);
    }
    sb.append(""+ 1);
    BigInteger biga = new BigInteger(sb.toString());


    bw.write(biga.toString()+"\n"+bigb.toString());
    bw.flush();	
    bw.close();
    br.close();
  }
}