#include <bits/stdc++.h>
using namespace std;
int A[1000005];
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= 9; i++) {
    int digit = i;
    int left = n - 1;
    int carry = 0;
    A[n] = digit;
    while (left) {
      int new_digit = digit * m + carry;
      int new_carry = new_digit / 10;
      carry = new_carry;
      digit = new_digit % 10;
      A[left--] = digit;
    }
    if (A[1] > 0 && A[1] * m + carry == i) {
      for (int i = 1; i <= n; i++) {
        cout << A[i];
      }
      return 0;
    }
  }
  cout << "Impossible" << endl;
}
