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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.Arrays;
import java.util.*;
import java.lang.*;
import java.awt.Font;
public class Solution
{
	static class FastReader
	{
		BufferedReader br;
		StringTokenizer st;
 
		public FastReader()
		{
			br = new BufferedReader(new
					InputStreamReader(System.in));
		}
 
		String next()
		{
			while (st == null || !st.hasMoreElements())
			{
				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());
		}
 
		String nextLine()
		{
			String str = "";
			try
			{
				str = br.readLine();
			}
			catch (IOException e)
			{
				e.printStackTrace();
			}
			return str;
		}
	}
	public static void main(String[] args){
		FastReader sc=new FastReader();
		int n=sc.nextInt(),m=sc.nextInt(),i;
		StringBuffer sb1=new StringBuffer(),sb2=new StringBuffer();
		for(i=0;i<2230;i++){
			sb1.append('5');
		}
		for(i=0;i<2230;i++){
			if(m>=5){
				sb2.append('9');
				m-=5;
			}
			else{
				sb2.append(m+4);
				m=0;
			}
		}
		int len=sb2.length();
		char arr[]=new char[len];
		for(i=0;i<len;i++){
			arr[len-i-1]=sb2.charAt(i);
		}
		String s=new String(arr);
		System.out.println(sb1+"\n"+s);
	}
}  