#include <bits/stdc++.h>
const int maxn = 2e5 + 10;
const int N = 2e5 + 10;
using namespace std;
int id(int l, int r) { return l + r | l != r; }
long long gcd(long long p, long long q) { return q == 0 ? p : gcd(q, p % q); }
long long qpow(long long p, long long q) {
  long long f = 1;
  while (q) {
    if (q & 1) f = f * p % 1000000007;
    p = p * p % 1000000007;
    q >>= 1;
  }
  return f;
}
int n, m, k, t, v, x[maxn], d[20], ret[maxn], l[20][maxn], r[20][maxn],
    dpl[1 << 20], dpr[1 << 20], tot;
int main() {
  int i, j;
  scanf("%d%d", &n, &v);
  for (i = 1; i <= n; i++) scanf("%d", &x[i]);
  while (v) {
    d[tot++] = v;
    v /= 2;
  }
  d[tot++] = 0;
  for (i = 0; i <= tot - 1; i++) {
    for (j = 1; j <= n; j++) {
      if (j > 1 && x[j] - x[j - 1] <= d[i])
        l[i][j] = l[i][j - 1];
      else
        l[i][j] = j;
    }
    for (j = n; j >= 1; j--) {
      if (j < n && x[j + 1] - x[j] <= d[i])
        r[i][j] = r[i][j + 1];
      else
        r[i][j] = j;
    }
  }
  memset(dpr, 0x3f3f3f3f, sizeof(dpr));
  dpl[0] = 0, dpr[0] = n + 1;
  for (i = 0; i <= (1 << tot) - 1; i++) {
    for (j = 0; j <= tot - 1; j++) {
      if (~i & (1 << j)) {
        if (dpl[i] + 1 <= n)
          dpl[i ^ (1 << j)] = max(dpl[i ^ (1 << j)], r[j][dpl[i] + 1]);
        if (dpr[i] - 1 >= 1)
          dpr[i ^ (1 << j)] = min(dpr[i ^ (1 << j)], l[j][dpr[i] - 1]);
      }
    }
  }
  for (i = 0; i <= (1 << tot) - 1; i++) {
    if (i & 1) continue;
    if (dpl[i] >= dpr[(i ^ ((1 << tot) - 1)) - 1]) {
      ret[1]++;
      ret[n + 1]--;
    } else {
      if (r[0][dpl[i] + 1] >= dpr[(i ^ ((1 << tot) - 1)) - 1] - 1) {
        int x = dpl[i] + 1;
        ret[l[0][x]]++;
        ret[r[0][x] + 1]--;
      }
    }
  }
  for (i = 1; i <= n; i++) {
    ret[i] += ret[i - 1];
    puts(ret[i] ? "Possible" : "Impossible");
  }
  return 0;
}
