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 int INF = 2147483640;
const int MAXN = 1111;
int N, M, t, k, q, x, y, val, num;
int op, m, n;
int Max, Min;
int vis[MAXN];
int X[MAXN], Y[MAXN];
int a[13][100005];
struct node {
  int x, y, op;
  node(int _op = 0, int _x = 0, int _y = 0) : op(_op), x(_x), y(_y) {}
};
node no[100005];
int main() {
  int cas = 0;
  int x, y, t;
  while (~scanf("%d%d", &n, &m)) {
    for (int i = 1; i <= 200; i++) printf("18");
    printf("\n");
    for (int i = 1; i < 200; i++) printf("81");
    printf("82\n");
  }
}