#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int main() {
  int m, s;
  cin >> m >> s;
  if (m > 1 && s == 0 || m * 9 < s) {
    cout << "-1 -1" << endl;
    return 0;
  }
  if (m == 1) {
    cout << s << " " << s << endl;
    return 0;
  }
  string temp;
  int s2 = s, ct = 0;
  while (s2 > 9) {
    temp.push_back('9');
    s2 -= 9;
    ct++;
  }
  if (m - ct > 1) {
    temp.push_back('1');
    s2--;
  }
  if (s2 != 0) temp.push_back('0' + s2);
  int sz = temp.size();
  sort(temp.begin(), temp.end());
  string tmp;
  tmp.push_back(temp[0]);
  for (int i = 0; i < m - sz; ++i) {
    tmp.push_back('0');
  }
  for (int i = 1; i < temp.size(); ++i) {
    tmp.push_back(temp[i]);
  }
  cout << tmp << " ";
  string temp2;
  int s3 = s, ct2 = 0;
  while (s3 > 9) {
    temp2.push_back('9');
    s3 -= 9;
    ct2++;
  }
  int p = m - ct2 - 1;
  for (int i = 0; i < p; ++i) {
    temp2.push_back('0');
  }
  temp2.push_back('0' + s3);
  sort(temp2.rbegin(), temp2.rend());
  cout << temp2 << endl;
  return 0;
}

### Prompt

Please formulate 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;
map<int, int> mp;
int main() {
  int m, s;
  cin >> m >> s;
  if (m > 1 && s == 0 || m * 9 < s) {
    cout << "-1 -1" << endl;
    return 0;
  }
  if (m == 1) {
    cout << s << " " << s << endl;
    return 0;
  }
  string temp;
  int s2 = s, ct = 0;
  while (s2 > 9) {
    temp.push_back('9');
    s2 -= 9;
    ct++;
  }
  if (m - ct > 1) {
    temp.push_back('1');
    s2--;
  }
  if (s2 != 0) temp.push_back('0' + s2);
  int sz = temp.size();
  sort(temp.begin(), temp.end());
  string tmp;
  tmp.push_back(temp[0]);
  for (int i = 0; i < m - sz; ++i) {
    tmp.push_back('0');
  }
  for (int i = 1; i < temp.size(); ++i) {
    tmp.push_back(temp[i]);
  }
  cout << tmp << " ";
  string temp2;
  int s3 = s, ct2 = 0;
  while (s3 > 9) {
    temp2.push_back('9');
    s3 -= 9;
    ct2++;
  }
  int p = m - ct2 - 1;
  for (int i = 0; i < p; ++i) {
    temp2.push_back('0');
  }
  temp2.push_back('0' + s3);
  sort(temp2.rbegin(), temp2.rend());
  cout << temp2 << endl;
  return 0;
}

```