#include <bits/stdc++.h>
using namespace std;
long long n, m, t, tm;
int main() {
  ios::sync_with_stdio(0);
  cout.tie(0), cin.tie(0);
  cin >> n >> m;
  int i = 1;
  while (i <= n) {
    t += 9;
    i++;
  }
  if (m + n <= 1) {
    return cout << "0 0", 0;
  }
  if ((m > t) || (m == 0 && n)) {
    return cout << "-1 -1", 0;
  }
  t = 0;
  long long m1 = m, n1 = n;
  string mx = "";
  while (m1 >= 9 && n1--) {
    mx += '9';
    m1 -= 9;
  }
  if (n1) {
    n1--;
    mx += char('0' + m1);
  }
  while (n1--) {
    mx += '0';
  }
  string mi = "";
  n1 = n;
  while (n) {
    long long c = 0;
    while (m * 1.0 / (n - 1) > 9 && m > 0) {
      c++;
      m--;
    }
    if (n == n1 && c == 0) {
      m--;
      c++;
    }
    mi += char('0' + c);
    n--;
  }
  mi += ' ';
  cout << mi << mx;
}

### Prompt

Please create a solution in Cpp 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;
long long n, m, t, tm;
int main() {
  ios::sync_with_stdio(0);
  cout.tie(0), cin.tie(0);
  cin >> n >> m;
  int i = 1;
  while (i <= n) {
    t += 9;
    i++;
  }
  if (m + n <= 1) {
    return cout << "0 0", 0;
  }
  if ((m > t) || (m == 0 && n)) {
    return cout << "-1 -1", 0;
  }
  t = 0;
  long long m1 = m, n1 = n;
  string mx = "";
  while (m1 >= 9 && n1--) {
    mx += '9';
    m1 -= 9;
  }
  if (n1) {
    n1--;
    mx += char('0' + m1);
  }
  while (n1--) {
    mx += '0';
  }
  string mi = "";
  n1 = n;
  while (n) {
    long long c = 0;
    while (m * 1.0 / (n - 1) > 9 && m > 0) {
      c++;
      m--;
    }
    if (n == n1 && c == 0) {
      m--;
      c++;
    }
    mi += char('0' + c);
    n--;
  }
  mi += ' ';
  cout << mi << mx;
}

```