#include <bits/stdc++.h>
using namespace std;
bool ok(int m, int s) { return s <= 9 * m; }
string small(int m, int s) {
  string res;
  for (int i = 0; i < m; i++) {
    int d = -1;
    for (int j = (i ? 0 : 1); j < 10; j++) {
      if (j <= s && ok(m - i - 1, s - j)) {
        d = j;
        break;
      }
    }
    if (d == -1) {
      return "-1";
    }
    res += char(d + '0');
    s -= d;
  }
  return res;
}
string big(int m, int s) {
  string res;
  for (int i = 0; i < m; i++) {
    int d = -1;
    for (int j = 9; j >= (i ? 0 : 1); j--) {
      if (j <= s && ok(m - i - 1, s - j)) {
        d = j;
        break;
      }
    }
    if (d == -1) {
      return "-1";
    }
    res += char(d + '0');
    s -= d;
  }
  return res;
}
int main() {
  int m, s;
  cin >> m >> s;
  if (m == 1 && s == 0) {
    cout << 0 << " " << 0 << endl;
  } else {
    cout << small(m, s) << " " << big(m, s) << endl;
  }
  return 0;
}

### Prompt

Create a solution in cpp for 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;
bool ok(int m, int s) { return s <= 9 * m; }
string small(int m, int s) {
  string res;
  for (int i = 0; i < m; i++) {
    int d = -1;
    for (int j = (i ? 0 : 1); j < 10; j++) {
      if (j <= s && ok(m - i - 1, s - j)) {
        d = j;
        break;
      }
    }
    if (d == -1) {
      return "-1";
    }
    res += char(d + '0');
    s -= d;
  }
  return res;
}
string big(int m, int s) {
  string res;
  for (int i = 0; i < m; i++) {
    int d = -1;
    for (int j = 9; j >= (i ? 0 : 1); j--) {
      if (j <= s && ok(m - i - 1, s - j)) {
        d = j;
        break;
      }
    }
    if (d == -1) {
      return "-1";
    }
    res += char(d + '0');
    s -= d;
  }
  return res;
}
int main() {
  int m, s;
  cin >> m >> s;
  if (m == 1 && s == 0) {
    cout << 0 << " " << 0 << endl;
  } else {
    cout << small(m, s) << " " << big(m, s) << endl;
  }
  return 0;
}

```