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 PYTHON):

Solution:
import decimal,math
from collections import *
from fractions import gcd
from bisect import bisect_right,bisect_left
import sys

decimal.getcontext().prec = 15

def primeFactors(n): 
	arr =set([])
	while n % 2 == 0: 
		arr.add(2) 
		n = n / 2
	for i in xrange(3,int(math.sqrt(n))+1,2): 
		while n % i== 0: 
			arr.add(i) 
			n = n / i 
	if n > 2: 
		arr.add(n)
		# print n
	return arr	 
def z_advanced(s):
	Z = [0] * len(s)
	Z[0] = len(s) 
	rt = 0
	lt = 0
	for k in xrange(1, len(s)):
		if k > rt:
			n = 0
			while n + k < len(s) and s[n] == s[n+k]:
				n += 1
			Z[k] = n
			if n > 0:
				lt = k
				rt = k+n-1
		else:
			p = k - lt  # Pair index.
			right_part_len = rt - k + 1 
			if Z[p] < right_part_len:
				Z[k] = Z[p]
			else:
				i = rt + 1
				while i < len(s) and s[i] == s[i - k]:
					i += 1
				Z[k] = i - k
 
				lt = k
				rt = i - 1
	return max(Z)
def invmod(i,mod):
	return pow(i,mod-2,mod)	
def fact(mod):
	fac= [1,1]
	ifac = [1,1]
	for i in xxrange(2,(3*10**5+ 2)):
		fac.append((fac[-1]*i)%mod)
		# ifac.append((ifac[-1]*invmod(i,mod))%mod)
	return fac,ifac	
def SieveOfEratosthenes(n): 
	prime = [True for i in xrange(n+1)] 
	p = 2
	while (p * p <= n): 
		if (prime[p] == True): 
			
			for i in xrange(p * p, n+1, p): 
				prime[i] = False
		p += 1
	arr=[]
	for p in xrange(2, n): 
		if prime[p]: 
			arr.append(p)
	return arr
def maxSubArraySum(a):
	size=len(a)       
	max_so_far =a[0] 
	curr_max = a[0] 
	for i in xrange(1,size): 
		curr_max = max(a[i], curr_max + a[i]) 
		max_so_far = max(max_so_far,curr_max) 
	return max_so_far 	
def fi():
	return int(sys.stdin.readline())
 
def fi2():
	return map(int, sys.stdin.readline().split())
 
def fi3():
	return sys.stdin.readline()
 
def fo(*args):
	for s in args:
		sys.stdout.write(str(s)+' ')
	sys.stdout.write('\n')
n,m=fi2()
print '45'*400
print (('54'*400)[:-1]+'5')