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.util.Scanner;

public class Main{
	
	public static int sum(int a) {
		
			int s = 0;
			while (a>0) {
				s+=a%10;
				a=a/10;
				
			}
			
			return s;
		
		
	}

	public static void main(String[] args) {
		Scanner scanner=new Scanner(System.in);
		String s[]= scanner.nextLine().split(" ");
		int n = Integer.parseInt(s[0]);
		int m = Integer.parseInt(s[0]);
		int a = 0;
		int b = 0;
		for(int i=0;i<n;i++) {
			System.out.print(1);
		}
		System.out.println();
		for(int i=0;i<n-1;i++) {
			System.out.print(8);
		}
		System.out.println(9);
		//System.out.print(sum(888889));
		
	}

}