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;
long long m = 10000000;
long long f(long long n, long long r) {
  if (r == 0) {
    return 1;
  } else if (r % 2 == 1) {
    long long v = f(n, (r - 1) / 2);
    return (((v * v) % m) * n % m);
  } else {
    long long v = f(n, r / 2);
    return (v * v) % m;
  }
}
int a = 0, b = 1, c;
int* gcd(int n, int k, int d[]) {
  if (k == 1) {
    d[0] = k;
    return 0;
  }
  gcd(k, n % k, d);
  c = b;
  b = a + b * (-(n / k));
  a = c;
  d[1] = a;
  d[2] = b;
  return d;
}
int main() {
  cout << string(2230, '5') << '\n' << string(2229, '4') << 5;
  return 0;
}