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.

Difficulty: EASY

Solutions:
(n, m) = map(int, input().split())
print(n * '1')
print((n - 1) * '8' + '9')


(a, b) = input().split()
a = int(a)
b = int(b)
print('1' * a, '8' * (a - 1) + '9', sep='\n')


(n, l) = map(int, input().split())
s1 = ''
s2 = ''
for i in range(n):
	s1 += '1'
for i in range(n - 1):
	s2 += '8'
s2 += '9'
print(s1)
print(s2)


(n, m) = [int(x) for x in input().split()]
for i in range(0, n):
	print(1, end='')
print()
for i in range(0, n - 1):
	print(8, end='')
print(9)


(n, m) = map(int, input().split())

def sum_digits(n):
	r = 0
	while n:
		(r, n) = (r + n % 10, n // 10)
	return r
a_str = '1' * n
b_str = '8' * (n - 1)
b_str += '9'
a = int(a_str)
b = int(b_str)
print(a)
print(b)


(a, b) = map(int, input().split())
print('1' * a)
print(int('1' + '0' * a) - int('1' * a))


(n, m) = [int(x) for x in input().split()]
print('1' * n)
print('8' * (n - 1) + '9')


ar = [int(i) for i in input().split()]
n = ar[0]
m = ar[1]
s = '1' * n
t = '8' * (n - 1) + '9'
print(s)
print(t)


import sys
import math
fileoperation = 0
if fileoperation:
	orig_stdout = sys.stdout
	orig_stdin = sys.stdin
	inputfile = open('W:/Competitive Programming/input.txt', 'r')
	outputfile = open('W:/Competitive Programming/output.txt', 'w')
	sys.stdin = inputfile
	sys.stdout = outputfile
mod = 1000000007

def nospace(l):
	ans = ''.join((str(i) for i in l))
	return ans
(n, m) = map(int, sys.stdin.readline().split(' '))
v1 = n // 9
v1 += 1
print('1' * n)
print('8' * (n - 1) + '9')
if fileoperation:
	sys.stdout = orig_stdout
	sys.stdin = orig_stdin
	inputfile.close()
	outputfile.close()


(n, m) = map(int, input().strip().split())
r1 = '1' * n
r2 = '1' + '0' * n
w = int(r2) - int(r1)
print(r1)
print(w)


l = list(map(int, input().split()))
n = l[0]
m = l[1]
for i in range(n):
	print('1', end='')
print()
for j in range(n - 1):
	print('8', end='')
print('9')


s = input().split()
n = int(s[0])
m = int(s[1])
print('1' * n)
print(int('8' * (n - 1) + '9'))


(n, m) = list(map(int, input().split()))
a = ['1'] * n
b = ['8'] * (n - 1) + ['9']
print(''.join(a))
print(''.join(b))


(n, m) = [int(i) for i in input().split()]
print('1' * n)
print('8' * (n - 1) + '9')


(n, m) = input().split()
(n, m) = [int(n), int(m)]
a = '1' * n
b = '9'
b = '8' * (n - 1) + b
print(a)
print(b)


(n, m) = [int(x) for x in input().split()]
x = n - 1
s = 0
while x >= 0:
	s += pow(10, x)
	x -= 1
print(s)
print(pow(10, n) - s)