#include <bits/stdc++.h>
using namespace std;
int m, s;
bool dp[1001][200], dp2[1001][200];
string solve(string curAns, int curSum, int curPos) {
  if (curSum > s) return "-1";
  if (dp[curSum][curPos]) return "-1";
  dp[curSum][curPos] = true;
  if (curPos == m) {
    if (curSum == s) return curAns;
    return "-1";
  }
  for (int i = 9; i >= 0; i--) {
    if (curPos == 0 && m > 1 && i == 0) continue;
    char num = i + '0';
    string ret = solve(curAns + num, curSum + i, curPos + 1);
    if (ret != "-1") return ret;
  }
  return "-1";
}
string solve2(string curAns, int curSum, int curPos) {
  if (curSum > s) return "-1";
  if (dp2[curSum][curPos]) return "-1";
  dp2[curSum][curPos] = true;
  if (curPos == m) {
    if (curSum == s) return curAns;
    return "-1";
  }
  for (int i = 0; i <= 9; i++) {
    if (i == 0 && curPos == 0 && m > 1) continue;
    char num = i + '0';
    string ret = solve2(curAns + num, curSum + i, curPos + 1);
    if (ret != "-1") return ret;
  }
  return "-1";
}
int main() {
  cin >> m >> s;
  cout << solve2("", 0, 0) << " " << solve("", 0, 0) << endl;
  return 0;
}

### Prompt

Please provide a CPP coded solution to the problem described below:

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 m, s;
bool dp[1001][200], dp2[1001][200];
string solve(string curAns, int curSum, int curPos) {
  if (curSum > s) return "-1";
  if (dp[curSum][curPos]) return "-1";
  dp[curSum][curPos] = true;
  if (curPos == m) {
    if (curSum == s) return curAns;
    return "-1";
  }
  for (int i = 9; i >= 0; i--) {
    if (curPos == 0 && m > 1 && i == 0) continue;
    char num = i + '0';
    string ret = solve(curAns + num, curSum + i, curPos + 1);
    if (ret != "-1") return ret;
  }
  return "-1";
}
string solve2(string curAns, int curSum, int curPos) {
  if (curSum > s) return "-1";
  if (dp2[curSum][curPos]) return "-1";
  dp2[curSum][curPos] = true;
  if (curPos == m) {
    if (curSum == s) return curAns;
    return "-1";
  }
  for (int i = 0; i <= 9; i++) {
    if (i == 0 && curPos == 0 && m > 1) continue;
    char num = i + '0';
    string ret = solve2(curAns + num, curSum + i, curPos + 1);
    if (ret != "-1") return ret;
  }
  return "-1";
}
int main() {
  cin >> m >> s;
  cout << solve2("", 0, 0) << " " << solve("", 0, 0) << endl;
  return 0;
}

```