#include <bits/stdc++.h>
using namespace std;
int a[301], b[301];
int main() {
  int n, m, i, j, k, y, t;
  string str;
  cin >> n >> m;
  if (m == 0 && n == 1) {
    cout << "0 0";
    return 0;
  }
  if (m == 0 || n * 9 < m) {
    cout << "-1 -1";
    return 0;
  }
  t = m;
  for (i = 1; i <= n; i++) {
    b[i] = min(9, t);
    t -= b[i];
  }
  t = m - 1;
  for (i = n; i; i--) {
    a[i] = min(9, t);
    t -= a[i];
  }
  a[1]++;
  for (i = 1; i <= n; i++) cout << a[i];
  cout << ' ';
  for (i = 1; i <= n; i++) cout << b[i];
  return 0;
}

### 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 a[301], b[301];
int main() {
  int n, m, i, j, k, y, t;
  string str;
  cin >> n >> m;
  if (m == 0 && n == 1) {
    cout << "0 0";
    return 0;
  }
  if (m == 0 || n * 9 < m) {
    cout << "-1 -1";
    return 0;
  }
  t = m;
  for (i = 1; i <= n; i++) {
    b[i] = min(9, t);
    t -= b[i];
  }
  t = m - 1;
  for (i = n; i; i--) {
    a[i] = min(9, t);
    t -= a[i];
  }
  a[1]++;
  for (i = 1; i <= n; i++) cout << a[i];
  cout << ' ';
  for (i = 1; i <= n; i++) cout << b[i];
  return 0;
}

```