#include <bits/stdc++.h>
using namespace std;
const long long N = 1000000007;
void solve() {
  long long n, a, b, c, ans = 0, count = 0, sum = 0;
  cin >> n >> sum;
  long long temp = sum;
  if (sum == 0 && n == 1) {
    cout << 0 << " " << 0 << endl;
    return;
  }
  if (sum == 0 || sum > 9 * n) {
    cout << -1 << " " << -1 << endl;
    return;
  }
  string res;
  while (count < n) {
    for (long long i = 9; i >= 0; i--) {
      if (sum - i >= 0) {
        res += '0' + i;
        sum -= i;
        count++;
        break;
      }
    }
  }
  string res2;
  count = n - 1;
  bool no_one = true;
  sum = temp;
  while (count >= 0) {
    for (long long i = 0; i <= 9; i++) {
      if (no_one && i == 0) continue;
      if (sum - i <= count * 9) {
        if (i != 0) no_one = false;
        res2 += '0' + i;
        sum -= i;
        count--;
        break;
      }
    }
  }
  cout << res2 << " ";
  cout << res << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  { solve(); }
  return 0;
}

### Prompt

Generate 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;
const long long N = 1000000007;
void solve() {
  long long n, a, b, c, ans = 0, count = 0, sum = 0;
  cin >> n >> sum;
  long long temp = sum;
  if (sum == 0 && n == 1) {
    cout << 0 << " " << 0 << endl;
    return;
  }
  if (sum == 0 || sum > 9 * n) {
    cout << -1 << " " << -1 << endl;
    return;
  }
  string res;
  while (count < n) {
    for (long long i = 9; i >= 0; i--) {
      if (sum - i >= 0) {
        res += '0' + i;
        sum -= i;
        count++;
        break;
      }
    }
  }
  string res2;
  count = n - 1;
  bool no_one = true;
  sum = temp;
  while (count >= 0) {
    for (long long i = 0; i <= 9; i++) {
      if (no_one && i == 0) continue;
      if (sum - i <= count * 9) {
        if (i != 0) no_one = false;
        res2 += '0' + i;
        sum -= i;
        count--;
        break;
      }
    }
  }
  cout << res2 << " ";
  cout << res << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  { solve(); }
  return 0;
}

```