#include <bits/stdc++.h>
using namespace std;
int main() {
  int m, s, mn[100];
  int i, x;
  cin >> m >> s;
  if (9 * m < s || s == 0) {
    if (s == 0 && m == 1)
      cout << "0 0\n";
    else {
      cout << "-1 -1" << endl;
    }
  } else {
    x = s;
    for (i = 0; i < m; i++)
      if (x == 1 && i < m - 1)
        mn[i] = 0;
      else if (i < m - 1) {
        mn[i] = min(x - 1, 9);
        x -= mn[i];
      } else
        mn[i] = x;
    for (i = m - 1; i >= 0; --i) cout << mn[i];
    cout << ' ';
    x = s / 9;
    for (i = 0; i < x; ++i) cout << 9;
    if (x == 0) {
      cout << s;
      x++;
    } else if (s % 9 != 0) {
      cout << s - x * 9;
      x++;
    }
    for (i = x; i < m; ++i) cout << 0;
    cout << endl;
  }
  return 0;
}

### Prompt

Construct a CPP code solution to the problem outlined:

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 m, s, mn[100];
  int i, x;
  cin >> m >> s;
  if (9 * m < s || s == 0) {
    if (s == 0 && m == 1)
      cout << "0 0\n";
    else {
      cout << "-1 -1" << endl;
    }
  } else {
    x = s;
    for (i = 0; i < m; i++)
      if (x == 1 && i < m - 1)
        mn[i] = 0;
      else if (i < m - 1) {
        mn[i] = min(x - 1, 9);
        x -= mn[i];
      } else
        mn[i] = x;
    for (i = m - 1; i >= 0; --i) cout << mn[i];
    cout << ' ';
    x = s / 9;
    for (i = 0; i < x; ++i) cout << 9;
    if (x == 0) {
      cout << s;
      x++;
    } else if (s % 9 != 0) {
      cout << s - x * 9;
      x++;
    }
    for (i = x; i < m; ++i) cout << 0;
    cout << endl;
  }
  return 0;
}

```