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.
import java.io.PrintWriter;
import java.util.Scanner;

public class B {
	
	public void solve(Scanner in, PrintWriter out) {
		int n = 1129;
		int[] a = new int[400];
		int[] b = new int[400];
		for(int i = 0; i < 200; ++i) a[i] = 9;
		a[399] = 1;
		for(int i = 0; i < 200; ++i) b[i + 200] = 9;
		for(int i = 0; i < 400; ++i) out.print(a[i]);
		out.println();
		for(int i = 200; i < 400; ++i) out.print(b[i]);
		out.println();
	}
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		new B().solve(in, out);
		in.close();
		out.close();
	}
}
