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.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class AAA {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());	
		int n=Integer.parseInt(st.nextToken());
		int m=Integer.parseInt(st.nextToken());
		for (int i = 0; i < 2230; i++)
			System.out.print('5');
		System.out.println();
		for (int i = 1; i < 2230; i++)
			System.out.print('4');
		System.out.print('5');
//		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
//		StringTokenizer st = new StringTokenizer(br.readLine());
//		int n=Integer.parseInt(st.nextToken());
//		int m=Integer.parseInt(st.nextToken());
//		int a =n;
//		int b=n;
//		boolean inc=false;
//		while(!(s(a)>=n && s(b)>=n && s(a+b)<=m)) {
//			if(!inc)
//				a++;
//			else
//				b++;
//			inc=!inc;
//			
//		}
//		System.out.println(a);
//		System.out.println(b);
//		
//	}
//	public static int s(int x) {
//		int result=0;
//		if(x<10) {
//			result=x;
//		}
//		else {
//			while(x>0) {
//				int digit = x%10;
//				result+=digit;
//				x=x/10;
//			}
//			
//		}
//		return result;
//		
//		
	}
		
}