#include <bits/stdc++.h>
using namespace std;
int N, V, K;
int X[200010], L[22][200010], R[22][200010];
vector<int> P;
int cc1[1 << 22];
int dp1(int mask) {
  if (mask == 0) return -1;
  int &ret = cc1[mask];
  if (ret != -1) return ret;
  if (mask == 0) return ret = 0;
  ret = -1;
  for (int i = 0; i < K; i++) {
    if (mask & (1 << i)) {
      ret = max(ret, (dp1(mask - (1 << i)) == N - 1
                          ? N - 1
                          : R[i][dp1(mask - (1 << i)) + 1]));
    }
  }
  return ret;
}
int cc2[1 << 22];
int dp2(int mask) {
  if (mask == 0) return N;
  int &ret = cc2[mask];
  if (ret != -1) return ret;
  ret = N;
  for (int i = 0; i < K; i++) {
    if (mask & (1 << i)) {
      ret =
          min(ret,
              (dp2(mask - (1 << i)) == 0 ? 0 : L[i][dp2(mask - (1 << i)) - 1]));
    }
  }
  return ret;
}
int main() {
  scanf("%d %d", &N, &V);
  for (int i = 0; i < N; i++) {
    scanf("%d", &X[i]);
  }
  P.push_back(V);
  while (P.back()) {
    int t = P.back() / 2;
    P.push_back(t);
  }
  reverse(P.begin(), P.end());
  K = P.size();
  for (int i = 0; i < K; i++) {
    int pos = 0;
    for (int j = 0; j < N; j++) {
      if (pos < j) pos = j;
      while (pos < N - 1 && X[pos + 1] - X[pos] <= P[i]) pos++;
      R[i][j] = pos;
    }
    pos = N - 1;
    for (int j = N - 1; j >= 0; j--) {
      if (pos > j) pos = j;
      while (pos >= 1 && X[pos] - X[pos - 1] <= P[i]) pos--;
      L[i][j] = pos;
    }
  }
  memset(cc1, -1, sizeof(cc1));
  memset(cc2, -1, sizeof(cc2));
  if (dp1((1 << K) - 1) != N - 1) {
    for (int i = 0; i < N; i++) {
      printf("Impossible\n");
    }
    return 0;
  }
  int pos = 0;
  while (pos < N) {
    int nxt = R[K - 1][pos];
    bool ok = false;
    for (int i = 0; i < (1 << (K - 1)); i++) {
      if (pos - 1 <= dp1(i) && dp2((1 << (K - 1)) - i) <= nxt + 1) {
        ok = true;
        break;
      }
    }
    if (ok) {
      for (int i = pos; i <= nxt; i++) {
        printf("Possible\n");
      }
    } else {
      for (int i = pos; i <= nxt; i++) {
        printf("Impossible\n");
      }
    }
    pos = nxt + 1;
  }
}
