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;
string convert(long long N) {
  string res = "";
  while (N > 0) {
    if (N > 10) {
      res += ('9');
      N -= 10;
    } else {
      res += (char)(N + '0');
      N = 0;
    }
  }
  return res;
}
long long val(string s) {
  long long res = 0;
  for (auto a : s) {
    res = res * 10 + (a - '0');
  }
  return res;
}
int main() {
  ios::sync_with_stdio(false);
  int len = 400;
  cout << string(len, '5') << "\n";
  cout << (string(len - 1, '4') + '5') << "\n";
  return 0;
}