#include <bits/stdc++.h>
using namespace std;
int a[100];
int b[100];
int main() {
  int n, s;
  cin >> n >> s;
  int s1 = s;
  a[1] = 1;
  if (s == 0 && n == 1) {
    cout << 0 << " " << 0;
    return 0;
  }
  if (s == 0) {
    cout << -1 << " " << -1;
    return 0;
  }
  if (9 * n < s) {
    cout << -1 << " " << -1;
    return 0;
  }
  s -= 1;
  for (int i = n; i > 1; i--) {
    if (s > 0) {
      if (s >= 9) {
        a[i] = 9;
        s -= 9;
      } else {
        a[i] = s;
        s = 0;
      }
    }
  }
  if (s > 0) {
    a[1] += s;
  }
  for (int i = 1; i <= n; i++) cout << a[i];
  cout << " ";
  for (int i = 1; i <= n; i++) {
    if (s1 > 0) {
      if (s1 >= 9) {
        b[i] = 9;
        s1 -= 9;
      } else {
        b[i] = s1;
        s1 = 0;
      }
    }
  }
  for (int i = 1; i <= n; i++) cout << b[i];
}

### Prompt

In CPP, your task is to solve 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 a[100];
int b[100];
int main() {
  int n, s;
  cin >> n >> s;
  int s1 = s;
  a[1] = 1;
  if (s == 0 && n == 1) {
    cout << 0 << " " << 0;
    return 0;
  }
  if (s == 0) {
    cout << -1 << " " << -1;
    return 0;
  }
  if (9 * n < s) {
    cout << -1 << " " << -1;
    return 0;
  }
  s -= 1;
  for (int i = n; i > 1; i--) {
    if (s > 0) {
      if (s >= 9) {
        a[i] = 9;
        s -= 9;
      } else {
        a[i] = s;
        s = 0;
      }
    }
  }
  if (s > 0) {
    a[1] += s;
  }
  for (int i = 1; i <= n; i++) cout << a[i];
  cout << " ";
  for (int i = 1; i <= n; i++) {
    if (s1 > 0) {
      if (s1 >= 9) {
        b[i] = 9;
        s1 -= 9;
      } else {
        b[i] = s1;
        s1 = 0;
      }
    }
  }
  for (int i = 1; i <= n; i++) cout << b[i];
}

```