489_C. Given Length and Sum of Digits..._33157
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
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
int solve() {
  int m, s;
  cin >> m >> s;
  if (s == 0) {
    if (m != 1) {
      cout << "-1 -1" << endl;
    } else if (m == 1) {
      cout << "0 0" << endl;
    }
  } else {
    string mini = "", maxi = "";
    for (long long i = 0; i < m; i++) {
      int k = min(9, s);
      maxi.push_back('0' + k);
      s -= k;
    }
    if (s > 0) {
      cout << "-1 -1";
      return 0;
    }
    mini = maxi;
    reverse(mini.begin(), mini.end());
    int j = 0;
    while (mini[j] == '0') {
      j++;
    }
    mini[j]--;
    mini[0]++;
    cout << mini << " " << maxi;
  }
}
int main() { solve(); }
