#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  cin >> n >> m;
  if (n == 1 && m == 0) {
    cout << 0 << ' ' << 0;
    return 0;
  }
  if (m == 0 || m > n * 9) {
    cout << -1 << ' ' << -1;
    return 0;
  }
  vector<int> large(n);
  vector<int> small;
  for (int i = 0; i < n; i++) {
    large[i] = m >= 9 ? 9 : m % 9;
    m >= 9 ? m = m - 9 : m = 0;
  }
  int z = n;
  int val;
  for (int i = 0; i < n; i++) {
    if (i + 1 < n && large[i + 1] == 0) {
      val = large[i];
      break;
    } else if (i == n - 1) {
      val = large[i];
    } else {
      small.push_back(large[i]);
      z--;
    }
  }
  if (z == 1) {
    cout << val;
    for (int i = 0; i < small.size(); i++) {
      cout << small[i];
    }
    cout << ' ';
  } else {
    cout << 1;
    for (int i = 0; i < z - 2; i++) {
      cout << 0;
    }
    cout << val - 1;
    for (int i = 0; i < small.size(); i++) {
      cout << small[i];
    }
    cout << ' ';
  }
  for (int i = 0; i < n; i++) {
    cout << large[i];
  }
  return 0;
}

### 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 main() {
  int n, m;
  cin >> n >> m;
  if (n == 1 && m == 0) {
    cout << 0 << ' ' << 0;
    return 0;
  }
  if (m == 0 || m > n * 9) {
    cout << -1 << ' ' << -1;
    return 0;
  }
  vector<int> large(n);
  vector<int> small;
  for (int i = 0; i < n; i++) {
    large[i] = m >= 9 ? 9 : m % 9;
    m >= 9 ? m = m - 9 : m = 0;
  }
  int z = n;
  int val;
  for (int i = 0; i < n; i++) {
    if (i + 1 < n && large[i + 1] == 0) {
      val = large[i];
      break;
    } else if (i == n - 1) {
      val = large[i];
    } else {
      small.push_back(large[i]);
      z--;
    }
  }
  if (z == 1) {
    cout << val;
    for (int i = 0; i < small.size(); i++) {
      cout << small[i];
    }
    cout << ' ';
  } else {
    cout << 1;
    for (int i = 0; i < z - 2; i++) {
      cout << 0;
    }
    cout << val - 1;
    for (int i = 0; i < small.size(); i++) {
      cout << small[i];
    }
    cout << ' ';
  }
  for (int i = 0; i < n; i++) {
    cout << large[i];
  }
  return 0;
}

```