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 long double pi = acos(-1.0);
const long double eps = 1E-9;
const int INF = 1E9;
const int MAXN = 501, MAXLOG = 62;
int main() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);
  int n, m, sum_a = 0, sum_b = 0;
  cin >> n >> m;
  string a, b;
  while (sum_a < n) {
    sum_a += 9;
    a += "9";
  }
  while (sum_b < n - 1) {
    sum_b += 9;
    b += "9";
  }
  for (int i = 0; i < int(a.size()) - 1; i++) {
    b += "0";
  }
  b += "1";
  cout << a << endl << b;
  return 0;
}