#include <bits/stdc++.h>
using namespace std;
template <class T>
bool uin(T &a, T b) {
  return a > b ? (a = b, true) : false;
}
template <class T>
bool uax(T &a, T b) {
  return a < b ? (a = b, true) : false;
}
const int maxn = 210000, maxk = 20;
int x[maxn];
vector<int> w;
int fw[maxn][maxk], fb[maxn][maxk];
int jfw[1 << maxk], jfb[1 << maxk];
int dans[maxn];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, v;
  cin >> n >> v;
  for (int i = 0; i < (int)(n); ++i) cin >> x[i];
  w.push_back(v);
  while (w.back()) {
    int z = w.back();
    w.push_back(z / 2);
  }
  reverse((w).begin(), (w).end());
  int k = w.size();
  for (int i = (int)(n)-1; i >= 0; --i)
    for (int j = 0; j < (int)(k); ++j) {
      if (i + 1 < n && x[i + 1] - x[i] <= w[j])
        fw[i][j] = fw[i + 1][j];
      else
        fw[i][j] = i;
    }
  for (int i = 0; i < (int)(n); ++i)
    for (int j = 0; j < (int)(k); ++j) {
      if (i && x[i] - x[i - 1] <= w[j])
        fb[i][j] = fb[i - 1][j];
      else
        fb[i][j] = i;
    }
  for (int i = 0; i < (int)(1 << k); ++i) jfw[i] = -1, jfb[i] = n;
  jfw[0] = 0;
  jfb[0] = n - 1;
  for (int i = 0; i < (int)(1 << k); ++i) {
    for (int j = 0; j < (int)(k); ++j) {
      if ((i >> j) & 1) continue;
      if (jfw[i] < n) uax(jfw[i | (1 << j)], fw[jfw[i]][j] + 1);
      if (jfb[i] >= 0) uin(jfb[i | (1 << j)], fb[jfb[i]][j] - 1);
    }
  }
  for (int i = 0; i < (int)(1 << (k - 1)); ++i) {
    int l = jfw[i], r = jfb[(1 << (k - 1)) - i - 1];
    if (l + 1 >= r) {
      ++dans[0];
    } else if (fw[l][k - 1] >= r) {
      cerr << i << ' ' << l << ' ' << r << '\n';
      ++dans[l];
      --dans[r + 1];
    }
  }
  for (int i = 0; i < (int)(n - 1); ++i) dans[i + 1] += dans[i];
  for (int i = 0; i < (int)(n); ++i)
    cout << (dans[i] ? "Possible" : "Impossible") << '\n';
}
