#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long m, s;
  cin >> m >> s;
  if (s == 0) {
    if (m == 1) {
      cout << "0 0\n";
    } else {
      cout << "-1 -1\n";
    }
    return 0;
  }
  string s1;
  for (int i = 0; i < m; i++) {
    if (s > 9) {
      s1 += '9';
      s -= 9;
    } else {
      s1 += char(s + '0');
      s = 0;
    }
  }
  if (s > 0) {
    cout << "-1 -1\n";
    return 0;
  }
  string s2 = s1;
  int find = 0;
  reverse(s2.begin(), s2.end());
  if (s2[0] == '0') {
    for (int x = 0; x < m; x++) {
      if (s2[x] != '0') {
        find = x;
        break;
      }
    }
    s2[0]++;
    s2[find]--;
  }
  cout << s2 << " " << s1 << endl;
  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;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long m, s;
  cin >> m >> s;
  if (s == 0) {
    if (m == 1) {
      cout << "0 0\n";
    } else {
      cout << "-1 -1\n";
    }
    return 0;
  }
  string s1;
  for (int i = 0; i < m; i++) {
    if (s > 9) {
      s1 += '9';
      s -= 9;
    } else {
      s1 += char(s + '0');
      s = 0;
    }
  }
  if (s > 0) {
    cout << "-1 -1\n";
    return 0;
  }
  string s2 = s1;
  int find = 0;
  reverse(s2.begin(), s2.end());
  if (s2[0] == '0') {
    for (int x = 0; x < m; x++) {
      if (s2[x] != '0') {
        find = x;
        break;
      }
    }
    s2[0]++;
    s2[find]--;
  }
  cout << s2 << " " << s1 << endl;
  return 0;
}

```