#include <bits/stdc++.h>
using namespace std;
int n, v, logv;
int x[200010];
int f1[200010], f2[200010];
int l[22][200010], r[22][200010], cnt[22];
int find_l(int x, int pos) {
  pos++;
  int now = upper_bound(l[x] + 1, l[x] + 1 + cnt[x], pos) - l[x];
  now--;
  if (now <= 0) return pos;
  return max(r[x][now], pos - 1);
}
int find_r(int x, int pos) {
  pos--;
  int now = lower_bound(r[x] + 1, r[x] + 1 + cnt[x], pos) - r[x];
  if (now > cnt[x]) return pos;
  return min(l[x][now], pos + 1);
}
int ans[200010];
int main() {
  memset(f2, 0x3f3f3f3f, sizeof f2);
  scanf("%d%d", &n, &v);
  for (int i = 1; i <= n; i++) scanf("%d", &x[i]);
  x[0] = -0x3FFFFFFF;
  x[n + 1] = 0x3FFFFFFF;
  for (logv = 0; (1 << logv) <= v; logv++)
    ;
  logv++;
  for (int i = 0; i < logv; i++) {
    int v1 = v >> i;
    cnt[i] = 1;
    l[i][cnt[i]] = 1;
    for (int j = 1; j <= n; j++)
      if (x[j + 1] - x[j] > v1) {
        r[i][cnt[i]] = j;
        cnt[i]++;
        l[i][cnt[i]] = j + 1;
      }
    cnt[i]--;
  }
  if (cnt[0] > logv) {
    for (int i = 1; i <= n; i++) printf("Impossible\n");
    return 0;
  }
  f1[0] = 0;
  f2[0] = n + 1;
  for (int mask = 0; mask < (1 << logv); mask += 2)
    for (int i = 1; i < logv; i++)
      if ((mask & (1 << i)) != 0) {
        f1[mask] = max(f1[mask], find_l(i, f1[mask ^ (1 << i)]));
        f2[mask] = min(f2[mask], find_r(i, f2[mask ^ (1 << i)]));
      }
  for (int i = 1; i <= cnt[0]; i++) {
    int lft = l[0][i];
    int rit = r[0][i];
    for (int mask = 0; mask < (1 << logv); mask += 2) {
      int mask2 = ((1 << logv) - 2) ^ mask;
      if (f1[mask] >= lft - 1 && f2[mask2] <= rit + 1) {
        ans[i] = 1;
        break;
      }
    }
  }
  int las = 1;
  for (int i = 1; i <= n; i++) {
    if (i > r[0][las]) las++;
    if (ans[las] == 0)
      printf("Impossible\n");
    else
      printf("Possible\n");
  }
}
