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

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1130;
int main() {
  ios_base::sync_with_stdio(false);
  cout << fixed;
  cout.precision(10);
  int n, m;
  cin >> n >> m;
  vector<int> a(N), b(N);
  int magic = 285;
  for (int i = 0; i < magic - 1; ++i) {
    a[i] = 4;
  }
  a[magic - 1] = 5;
  for (int i = 0; i < magic; ++i) {
    b[i] = 5;
  }
  for (int i = 0; i < magic; ++i) {
    cout << a[i];
  }
  cout << " ";
  for (int i = 0; i < magic; ++i) {
    cout << b[i];
  }
  return 0;
}