#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int i, m, s;
  cin >> m >> s;
  if (s == 0) {
    if (m == 1)
      cout << 0 << ' ' << 0;
    else
      cout << -1 << ' ' << -1;
    return 0;
  }
  int req = 1;
  string s1 = "1", s2 = "9";
  for (i = 2; i <= m; i++) {
    s1 += '0';
    s2 += '9';
  }
  if (s < 1)
    cout << -1 << ' ';
  else {
    for (i = s1.size() - 1; i >= 0; i--) {
      if (req >= s) break;
      int d = s1[i] - '0';
      if (req + 9 - d >= s)
        s1[i] = s + d - req + '0';
      else
        s1[i] = '9';
      req = req - d + s1[i] - '0';
    }
    if (req >= s)
      cout << s1 << ' ';
    else
      cout << -1 << ' ';
  }
  if (s > 9 * m)
    cout << -1;
  else {
    req = 9 * m;
    for (i = s2.size() - 1; i >= 0; i--) {
      if (req <= s) break;
      if (req - 9 <= s)
        s2[i] = 9 + s - req + '0';
      else
        s2[i] = '0';
      req -= 9;
    }
    if (req <= s)
      cout << s2;
    else
      cout << -1;
  }
}

### Prompt

Your challenge is to write a Cpp solution 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() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int i, m, s;
  cin >> m >> s;
  if (s == 0) {
    if (m == 1)
      cout << 0 << ' ' << 0;
    else
      cout << -1 << ' ' << -1;
    return 0;
  }
  int req = 1;
  string s1 = "1", s2 = "9";
  for (i = 2; i <= m; i++) {
    s1 += '0';
    s2 += '9';
  }
  if (s < 1)
    cout << -1 << ' ';
  else {
    for (i = s1.size() - 1; i >= 0; i--) {
      if (req >= s) break;
      int d = s1[i] - '0';
      if (req + 9 - d >= s)
        s1[i] = s + d - req + '0';
      else
        s1[i] = '9';
      req = req - d + s1[i] - '0';
    }
    if (req >= s)
      cout << s1 << ' ';
    else
      cout << -1 << ' ';
  }
  if (s > 9 * m)
    cout << -1;
  else {
    req = 9 * m;
    for (i = s2.size() - 1; i >= 0; i--) {
      if (req <= s) break;
      if (req - 9 <= s)
        s2[i] = 9 + s - req + '0';
      else
        s2[i] = '0';
      req -= 9;
    }
    if (req <= s)
      cout << s2;
    else
      cout << -1;
  }
}

```