#include <bits/stdc++.h>
using namespace std;
const int MAX = 500010;
int n, m;
int seg[MAX];
int vis[MAX];
int p[MAX];
int in[MAX], out[MAX];
int aux = 0;
vector<int> adj[MAX];
set<int> s;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int x, s;
  cin >> x >> s;
  if (!s) {
    if (x == 1)
      cout << "0 0\n";
    else
      cout << "-1 -1\n";
    return 0;
  }
  if (9 * x < s) {
    cout << "-1 -1\n";
    return 0;
  }
  string sb;
  int s1 = s;
  for (int i = 1; i <= x; i++) {
    if (s > 9)
      sb += '9', s -= 9;
    else if (i == x)
      sb += '0' + s;
    else if (s > 1)
      sb += '0' + (s - 1), s = 1;
    else
      sb += '0';
  }
  reverse(sb.begin(), sb.end());
  cout << sb << "\n";
  string st;
  for (int i = 1; i <= x; i++) {
    if (s1 >= 9)
      st += '9', s1 -= 9;
    else
      st += s1 + '0', s1 = 0;
  }
  cout << st << "\n";
}

### Prompt

In CPP, your task is to solve 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;
const int MAX = 500010;
int n, m;
int seg[MAX];
int vis[MAX];
int p[MAX];
int in[MAX], out[MAX];
int aux = 0;
vector<int> adj[MAX];
set<int> s;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int x, s;
  cin >> x >> s;
  if (!s) {
    if (x == 1)
      cout << "0 0\n";
    else
      cout << "-1 -1\n";
    return 0;
  }
  if (9 * x < s) {
    cout << "-1 -1\n";
    return 0;
  }
  string sb;
  int s1 = s;
  for (int i = 1; i <= x; i++) {
    if (s > 9)
      sb += '9', s -= 9;
    else if (i == x)
      sb += '0' + s;
    else if (s > 1)
      sb += '0' + (s - 1), s = 1;
    else
      sb += '0';
  }
  reverse(sb.begin(), sb.end());
  cout << sb << "\n";
  string st;
  for (int i = 1; i <= x; i++) {
    if (s1 >= 9)
      st += '9', s1 -= 9;
    else
      st += s1 + '0', s1 = 0;
  }
  cout << st << "\n";
}

```