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.
/*
 * No package must be added here because some Online Judges don't support it
 * please remove, if any.
 * 
 */
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

/*
 * Only classes with 'Main' name are accepted in CodeChef and some other online judges
 */
public class Main {

	
	public static String output = "";

	public static void main(String[] args) {

		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int m , n;

		
		try {	
			
			String[] s = br.readLine().split(" ");

			n = Integer.parseInt(s[0]);
			m = Integer.parseInt(s[1]);

			StringBuilder least = new StringBuilder();
			StringBuilder greater = new StringBuilder();

			
			for(int i = 1; i < n; i++){
				least.append('1');
				greater.append('8');
			}

			least.append('1');
			greater.append('9');


			System.out.println(least);
			System.out.println(greater);
		} catch (IOException e) {
			e.printStackTrace();
		}
		// Print the final output
	}

}
