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;
int xx[9] = {000, -1, 1, 0, 0, -1, -1, 1, 1};
int yy[9] = {000, 0, 0, 1, -1, 1, -1, 1, -1};
int hx[8] = {1, -1, 2, -2, 2, -2, 1, -1};
int hy[8] = {2, 2, 1, 1, -1, -1, -2, -2};
int kx[8] = {1, 1, 0, -1, 1};
int ky[8] = {1, 0, 1, 0, 0};
double eps = 1e-8;
vector<int> v[200200];
int a[1000][1000];
int main() {
  ios_base::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cout << 1;
  cout << endl;
  for (int i = 1; i <= n - 1; i++) cout << 8;
  cout << 9;
}