#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int l, len, sum1, sum;
  cin >> l >> sum1;
  sum = sum1;
  len = l;
  string s;
  if (sum > 9 * len) {
    cout << "-1 -1"
         << "\n";
    return 0;
  }
  if (sum == 0 && len != 1) {
    cout << "-1 -1"
         << "\n";
    return 0;
  }
  if (sum == 0 && len == 1) {
    cout << "0 0";
    return 0;
  }
  if (sum > 9 * len - 8) {
    int fd = sum % 9;
    if (fd == 0) fd = 9;
    s += fd + 48;
    len--;
    sum -= fd;
  } else {
    s += "1";
    len--;
    sum -= 1;
  }
  bool flag = false;
  while (len > 0) {
    if (sum > 9 * len - 9) {
      int fd = sum % 9;
      if (fd == 0) fd = 9;
      s += fd + 48;
      len--;
      sum -= fd;
    } else {
      s += "0";
      len--;
      flag = true;
    }
  }
  cout << s << " ";
  if (sum1 >= 9) {
    cout << 9;
    l--;
    sum1 -= 9;
  }
  while (l > 0) {
    if (sum1 >= 9) {
      cout << 9;
      sum1 -= 9;
      l--;
    } else {
      cout << sum1;
      sum1 = 0;
      l--;
    }
  }
}

### 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;
const double pi = acos(-1.0);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int l, len, sum1, sum;
  cin >> l >> sum1;
  sum = sum1;
  len = l;
  string s;
  if (sum > 9 * len) {
    cout << "-1 -1"
         << "\n";
    return 0;
  }
  if (sum == 0 && len != 1) {
    cout << "-1 -1"
         << "\n";
    return 0;
  }
  if (sum == 0 && len == 1) {
    cout << "0 0";
    return 0;
  }
  if (sum > 9 * len - 8) {
    int fd = sum % 9;
    if (fd == 0) fd = 9;
    s += fd + 48;
    len--;
    sum -= fd;
  } else {
    s += "1";
    len--;
    sum -= 1;
  }
  bool flag = false;
  while (len > 0) {
    if (sum > 9 * len - 9) {
      int fd = sum % 9;
      if (fd == 0) fd = 9;
      s += fd + 48;
      len--;
      sum -= fd;
    } else {
      s += "0";
      len--;
      flag = true;
    }
  }
  cout << s << " ";
  if (sum1 >= 9) {
    cout << 9;
    l--;
    sum1 -= 9;
  }
  while (l > 0) {
    if (sum1 >= 9) {
      cout << 9;
      sum1 -= 9;
      l--;
    } else {
      cout << sum1;
      sum1 = 0;
      l--;
    }
  }
}

```