#include <bits/stdc++.h>
long long gcd(long long a, long long b) {
  if (a == 0 || b == 0) return (a + b);
  if (a > b) return (gcd(a % b, b));
  return (gcd(a, b % a));
}
int sqr(int x) { return (x * x); }
void out() {
  std::cout << "NO\n";
  exit(0);
}
using namespace std;
int a[1000009], p, x;
int main() {
  ios::sync_with_stdio(0);
  cin >> p >> x;
  for (a[p] = 1; a[p] <= 9; a[p]++) {
    int t = 0;
    for (int i = (int)(p - 1); i >= (int)(1); --i) {
      a[i] = a[i + 1] * x + t;
      t = a[i] / 10;
      a[i] %= 10;
    }
    a[0] = a[1] * x + t;
    if (a[1] != 0 && a[0] == a[p]) {
      for (int i = 0; i < (int)(p); i++) cout << a[i + 1];
      cout << endl;
      return 0;
      ;
    }
  }
  cout << "Impossible\n";
  return 0;
  ;
}
