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

Solution:
class CodeforcesTask1028BSolution:
    def __init__(self):
        self.result = ''

    def read_input(self):
        pass

    def process_task(self):
        self.result = "{0}\n{1}".format("9" * 200 + "0" * 199 + "1", "9" * 200)

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask1028BSolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())