#include <bits/stdc++.h>
using namespace std;
int main() {
  long long m, s;
  cin >> m >> s;
  if ((s == 0) and (m != 1))
    cout << -1 << " " << -1;
  else if ((s == 0) and (m == 1))
    cout << 0 << " " << 0;
  else if (s > 9 * m)
    cout << -1 << " " << -1;
  else {
    string minAns = "", maxAns = "";
    long long sLeftMin = s, sLeftMax = s;
    while (m > 0) {
      int temp = min(sLeftMax, (long long)9);
      sLeftMax -= temp;
      maxAns += to_string(temp);
      temp = min(sLeftMin, (long long)9);
      sLeftMin -= temp;
      if ((sLeftMin == 0) and (m > 1)) {
        temp--;
        sLeftMin++;
      }
      minAns = to_string(temp) + minAns;
      m--;
    }
    cout << minAns << " " << maxAns;
  }
  return 0;
}

### Prompt

Create a solution in CPP for 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() {
  long long m, s;
  cin >> m >> s;
  if ((s == 0) and (m != 1))
    cout << -1 << " " << -1;
  else if ((s == 0) and (m == 1))
    cout << 0 << " " << 0;
  else if (s > 9 * m)
    cout << -1 << " " << -1;
  else {
    string minAns = "", maxAns = "";
    long long sLeftMin = s, sLeftMax = s;
    while (m > 0) {
      int temp = min(sLeftMax, (long long)9);
      sLeftMax -= temp;
      maxAns += to_string(temp);
      temp = min(sLeftMin, (long long)9);
      sLeftMin -= temp;
      if ((sLeftMin == 0) and (m > 1)) {
        temp--;
        sLeftMin++;
      }
      minAns = to_string(temp) + minAns;
      m--;
    }
    cout << minAns << " " << maxAns;
  }
  return 0;
}

```