#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int f = 1, x = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int stack[20];
template <typename T>
inline void write(T x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  if (!x) {
    putchar('0');
    return;
  }
  int top = 0;
  while (x) stack[++top] = x % 10, x /= 10;
  while (top) putchar(stack[top--] + '0');
}
template <typename T>
inline void pr1(T x) {
  write(x);
  putchar(' ');
}
template <typename T>
inline void pr2(T x) {
  write(x);
  putchar('\n');
}
const int MAXMASK = (1 << 19);
const int MAXN = 20;
const int MAXM = 200005;
int a[MAXM], n, V, mx;
vector<pair<int, int> > vec[MAXN];
int L[MAXN][MAXM], R[MAXN][MAXM];
void work(int x, int o) {
  for (int i = 1, nxt; i <= n; i = nxt + 1) {
    nxt = i;
    while (nxt + 1 <= n && a[nxt + 1] - a[nxt] <= x) ++nxt;
    for (int j = i; j <= nxt; j++) L[o][j] = i, R[o][j] = nxt;
  }
}
int f[MAXMASK], g[MAXMASK], num[MAXN][MAXMASK], bin[25];
int main() {
  bin[1] = 1;
  for (int i = 2; i <= 20; i++) bin[i] = bin[i - 1] << 1;
  n = read();
  V = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  int temp = V;
  while (temp) work(temp, mx++), temp >>= 1;
  for (int i = 1; i <= n; i++) L[mx][i] = R[mx][i] = i;
  memset(g, 63, sizeof(g));
  g[0] = n + 1;
  for (int i = 1; i < bin[mx + 1]; i++)
    for (int j = 1; j <= mx; j++)
      if (i & bin[j]) {
        int pre = f[i ^ bin[j]];
        f[i] = max(f[i], R[j][pre + 1]);
        if (pre == n) f[i] = n;
        pre = g[i ^ bin[j]];
        g[i] = min(g[i], L[j][pre - 1]);
        if (pre == 1) g[i] = 1;
      }
  for (int i = 1; i <= n; i++) {
    bool tf = false;
    for (int j = 0; j < bin[mx + 1]; j++) {
      int lim1 = L[0][i], lim2 = R[0][i];
      if (f[j] >= lim1 - 1 && g[(bin[mx + 1] - 1) ^ j] <= lim2 + 1) {
        tf = true;
        break;
      }
    }
    if (tf)
      puts("Possible");
    else
      puts("Impossible");
  }
  return 0;
}
