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.
//package codechef;
 
import java.io.BufferedReader;
import java.util.Scanner;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.PrintWriter;
 
public class MarchCook2 {
	int INF = (int) 1e9;
	int MOD = 1000000007;
 
	void solve(InputReader in, PrintWriter out) throws IOException {
		int n = in.nextInt();
		int m = in.nextInt();
		char a[] = new char[n];
		char b[] = new char[n];
		for(int i=0;i<n;i++){
			a[i]='1';
		}
		b[n-1] = '9';
		for(int i=n-2;i>=0;i--){
			b[i] = '8';
		}
		System.out.println(a);
		System.out.println(b);
	}
 
	public static void main(String[] args) throws IOException {
		InputReader in = new InputReader();
		PrintWriter out = new PrintWriter(System.out);
		int t = 1;//in.nextInt();
		while (t-- > 0) {
			new MarchCook2().solve(in, out);
		}
		out.close();
	}
 
	static class InputReader {
		static BufferedReader br;
		static StringTokenizer st;
 
		public InputReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
 
		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}
 
		int nextInt() {
			return Integer.parseInt(next());
		}
 
		long nextLong() {
			return Long.parseLong(next());
		}
 
		double nextDouble() {
			return Double.parseDouble(next());
		}
	}
}
 