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.
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, a, b;
  bool bb = 1;
  string s, t;
  cin >> n >> m;
  a = b = 5;
  s = t = "5";
  while (a < n || b < n) {
    if (bb) {
      s.push_back('5');
      a += 5;
      t.push_back('4');
      b += 4;
    } else {
      s.push_back('4');
      a += 4;
      t.push_back('5');
      b += 5;
    }
    bb = !bb;
  }
  reverse(s.begin(), s.end());
  reverse(t.begin(), t.end());
  cout << s << endl;
  cout << t << endl;
  return 0;
}
