#include <bits/stdc++.h>
using namespace std;
int n, p, x;
int a[2001000], b[2001000];
int main() {
  while (~scanf("%d%d", &p, &x)) {
    int cp = 0;
    bool ft = false;
    for (int i = 1; i <= 9; i++) {
      cp = 0;
      a[p] = i;
      for (int j = p - 1; j >= 1; j--) {
        a[j] = cp + a[j + 1] * x;
        cp = a[j] / 10;
        a[j] %= 10;
      }
      if (a[1] * x + cp == a[p] && a[1] != 0) {
        for (int i = 1; i <= p; i++) printf("%d", a[i]);
        printf("\n");
        ft = true;
        break;
      }
    }
    if (!ft) puts("Impossible");
  }
  return 0;
}
