#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, n, t, s, tmp;
  cin >> n >> t;
  s = t;
  int a[n], b[n];
  for (i = 0; i < n; i++) {
    a[i] = 0;
    b[i] = 0;
  }
  if ((s == 0 && n != 1) || s > 9 * n) {
    cout << "-1 -1";
    return 0;
  }
  if (s == 0 && n == 1) {
    cout << "0 0";
    return 0;
    ;
  }
  int k = 0;
  i = n - 1;
  if (s <= (9 * (n - 1))) {
    a[0] = 1;
    s = s - 1;
    i = n - 1;
    k = 1;
  }
  while (i >= k || s > 0) {
    if (s > 9) {
      s = s - 9;
      a[i] = 9;
    } else {
      a[i] = s;
      s = 0;
    }
    i--;
  }
  tmp = 0;
  if (s != 0) {
    tmp = 1;
  }
  i = 0;
  s = t;
  while (i < n || s > 0) {
    if (s > 9) {
      b[i] = 9;
      s = s - 9;
    } else {
      b[i] = s;
      s = 0;
    }
    i++;
  }
  if (s != 0) tmp = 1;
  if (tmp == 1) {
    cout << "-1 -1";
  } else {
    for (i = 0; i < n; i++) printf("%d", a[i]);
    cout << " ";
    for (i = 0; i < n; i++) printf("%d", b[i]);
  }
}

### Prompt

Please create a solution in cpp to the following problem:

You have a positive integer m and a non-negative integer s. Your task is to find the smallest and the largest of the numbers that have length m and sum of digits s. The required numbers should be non-negative integers written in the decimal base without leading zeroes.

Input

The single line of the input contains a pair of integers m, s (1 ≤ m ≤ 100, 0 ≤ s ≤ 900) — the length and the sum of the digits of the required numbers.

Output

In the output print the pair of the required non-negative integer numbers — first the minimum possible number, then — the maximum possible number. If no numbers satisfying conditions required exist, print the pair of numbers "-1 -1" (without the quotes).

Examples

Input

2 15


Output

69 96


Input

3 0


Output

-1 -1

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, n, t, s, tmp;
  cin >> n >> t;
  s = t;
  int a[n], b[n];
  for (i = 0; i < n; i++) {
    a[i] = 0;
    b[i] = 0;
  }
  if ((s == 0 && n != 1) || s > 9 * n) {
    cout << "-1 -1";
    return 0;
  }
  if (s == 0 && n == 1) {
    cout << "0 0";
    return 0;
    ;
  }
  int k = 0;
  i = n - 1;
  if (s <= (9 * (n - 1))) {
    a[0] = 1;
    s = s - 1;
    i = n - 1;
    k = 1;
  }
  while (i >= k || s > 0) {
    if (s > 9) {
      s = s - 9;
      a[i] = 9;
    } else {
      a[i] = s;
      s = 0;
    }
    i--;
  }
  tmp = 0;
  if (s != 0) {
    tmp = 1;
  }
  i = 0;
  s = t;
  while (i < n || s > 0) {
    if (s > 9) {
      b[i] = 9;
      s = s - 9;
    } else {
      b[i] = s;
      s = 0;
    }
    i++;
  }
  if (s != 0) tmp = 1;
  if (tmp == 1) {
    cout << "-1 -1";
  } else {
    for (i = 0; i < n; i++) printf("%d", a[i]);
    cout << " ";
    for (i = 0; i < n; i++) printf("%d", b[i]);
  }
}

```