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 long INF = (1ll << 62) - 1;
const int inf = (1 << 30) - 1;
int sod(int p) {
  int ad = 0;
  while (p) {
    ad += p % 10;
    p /= 10;
  }
  return ad;
}
int main() {
  ios_base::sync_with_stdio(false);
  int n, m, a, b, f = 0;
  scanf("%d %d", &n, &m);
  for (int i = 0; i < 1000; i++) cout << 5 << "";
  cout << endl;
  for (int i = 0; i < 999; i++) cout << 4 << "";
  cout << 5;
  return 0;
}