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.*;

public class InputReader {
	static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
	int[][] pairs;
	public static void main(String[] args) throws IOException {
		InputReader e = new InputReader();
		e.init();
	}


	private void init() throws NumberFormatException, IOException {
		String initDat = reader.readLine();
		String ar[] = initDat.split(" ");
		int n = Integer.parseInt(ar[0]);
		if(n <= 5) {
			System.out.println(5);
			System.out.println(5);
		}
		else if(n <= 9) {
			System.out.println(45);
			System.out.println(55);
		}
		else {
		int rem = n%9;
		int many = n / 9;
		if(rem > 5) {
			many++;
		}
		for(int i = 0; i < many; i++) {
			System.out.print('4');
			System.out.print('5');
		}
		System.out.print('5');
		System.out.print("\n");
		for(int i = 0; i < many; i++) {
			System.out.print('5');
			System.out.print('4');
		}
		System.out.print('5');
		System.out.print("\n");
		}
	}
}