#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class t, class u>
void chmax(t& first, u second) {
  if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
  if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vc<vc<t>>;
using pi = pair<ll, ll>;
using vi = vc<ll>;
template <class t, class u>
ostream& operator<<(ostream& os, const pair<t, u>& p) {
  return os << "{" << p.first << "," << p.second << "}";
}
template <class t>
ostream& operator<<(ostream& os, const vc<t>& v) {
  os << "{";
  for (auto e : v) os << e << ",";
  return os << "}";
}
using uint = unsigned;
using ull = unsigned long long;
template <ll i, class T>
void print_tuple(ostream&, const T&) {}
template <ll i, class T, class H, class... Args>
void print_tuple(ostream& os, const T& t) {
  if (i) os << ",";
  os << get<i>(t);
  print_tuple<i + 1, T, Args...>(os, t);
}
template <class... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
  os << "{";
  print_tuple<0, tuple<Args...>, Args...>(os, t);
  return os << "}";
}
void print(ll x, ll suc = 1) {
  cout << x;
  if (suc == 1) cout << "\n";
  if (suc == 2) cout << " ";
}
ll read() {
  ll i;
  cin >> i;
  return i;
}
vi readvi(ll n, ll off = 0) {
  vi v(n);
  for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off;
  return v;
}
template <class T>
void print(const vector<T>& v, ll suc = 1) {
  for (ll i = ll(0); i < ll(v.size()); i++)
    print(v[i], i == ll(v.size()) - 1 ? suc : 2);
}
string readString() {
  string s;
  cin >> s;
  return s;
}
template <class T>
T sq(const T& t) {
  return t * t;
}
void yes(bool ex = true) {
  cout << "Yes" << endl;
  if (ex) exit(0);
}
void no(bool ex = true) {
  cout << "No" << endl;
  if (ex) exit(0);
}
constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; }
const ll infLL = LLONG_MAX / 3;
const ll inf = infLL;
ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); }
ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); }
ll popcount(signed t) { return __builtin_popcount(t); }
ll popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(ll i) { return i && (i & -i) == i; }
ll mask(ll i) { return (ll(1) << i) - 1; }
bool inc(ll first, ll second, ll c) { return first <= second && second <= c; }
template <class t>
void mkuni(vc<t>& v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
ll rand_int(ll l, ll r) {
  static random_device rd;
  static mt19937_64 gen(rd());
  return uniform_int_distribution<ll>(l, r)(gen);
}
const ll L = 20;
vi sub(vi x, ll v) {
  ll n = x.size();
  vi res(1 << L);
  vi r[L];
  for (ll k = ll(0); k < ll(L); k++) {
    r[k].resize(n + 1);
    if (((v << 1) >> k) == 0) continue;
    r[k][n] = n;
    for (ll i = ll(n) - 1; i >= ll(0); i--) {
      ll j = i + 1;
      if (j < n && x[j] - x[i] <= (v >> k)) j = r[k][j];
      r[k][i] = j;
    }
  }
  for (ll bit = ll(0); bit < ll(1 << L); bit++) {
    for (ll i = ll(0); i < ll(n); i++)
      if (!(bit & 1 << i)) {
        chmax(res[bit ^ 1 << i], r[i][res[bit]]);
      }
  }
  return res;
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);
  ll n, v;
  cin >> n >> v;
  vi x = readvi(n);
  vi len[2];
  for (ll k = ll(0); k < ll(2); k++) {
    len[k] = sub(x, v);
    for (ll i = ll(0); i < ll(n); i++) x[i] = -x[i];
    reverse(x.begin(), x.end());
  }
  void(0);
  vc<string> ans(n, "Impossible");
  if (len[0][(1 << L) - 1] == n) {
    for (ll i = ll(0); i < ll(n); i++) {
      if (i && x[i] - x[i - 1] <= v)
        ans[i] = ans[i - 1];
      else {
        ll j = i + 1;
        while (j < n && x[j] - x[j - 1] <= v) j++;
        for (ll bit = ll(0); bit < ll(1 << (L - 1)); bit++) {
          ll first = bit << 1;
          ll y = (mask(L - 1) ^ bit) << 1;
          if (len[0][first] >= i && len[1][y] >= n - j) {
            ans[i] = "Possible";
          }
        }
      }
    }
  }
  for (auto w : ans) cout << w << "\n";
}
