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;
bool compare(long long int x, long long int y) { return x > y; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) {
    long long int i = 0, j = 0, k = 0, l = 0, z = 0;
    long long int n, m = 0;
    cin >> n >> m;
    string a = "", b = "";
    string c = "4", d = "5";
    {
      z = n;
      while (z > 0) {
        if (z >= 5) {
          a = a + c;
          b = b + d;
          swap(c, d);
          z = z - 4;
        } else {
          a = a + "45";
          b = b + "55";
          z = 0;
        }
      }
      cout << a << endl;
      cout << b << endl;
    }
  }
}