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 gcd(long long x, long long y) { return x > 0 ? gcd(y % x, x) : y; }
long long lcm(long long x, long long y) { return x * y / gcd(x, y); }
int n, m;
int suan(int x) {
  int ans = 0;
  while (x) ans += x % 10, x /= 10;
  return ans;
}
int main() {
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(8);
  while (cin >> n >> m) {
    for (int i = 1; i <= 500; i++) cout << 5;
    cout << endl;
    for (int i = 1; i <= 499; i++) cout << 4;
    cout << 5 << endl;
  }
  return 0;
}