#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, ch = getchar(), f = 1;
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  return x * f;
}
const int N = 200005;
int n, V, vi[20], pos[N], col[20][N], lb[20][N], rb[20][N];
int dpL[N], dpR[N], vis[N];
int main() {
  n = read(), V = read();
  for (int i = 1; i <= n; ++i) pos[i] = read();
  for (int i = V; i; i >>= 1) vi[++vi[0]] = i;
  vi[++vi[0]] = 0;
  for (int i = 1; i <= vi[0]; ++i) {
    int idx = 1;
    lb[i][1] = col[i][1] = 1;
    for (int j = 2; j <= n; ++j) {
      if (pos[j] - pos[j - 1] > vi[i]) {
        rb[i][idx] = j - 1;
        lb[i][++idx] = j;
      }
      col[i][j] = idx;
    }
    rb[i][idx] = n;
  }
  int U = (1 << vi[0]) - 1;
  dpL[0] = 0;
  for (int i = 1; i <= U; ++i)
    for (int j = 0; j <= vi[0] - 1; ++j)
      if (i & (1 << j))
        dpL[i] = max(dpL[i], rb[j + 1][col[j + 1][dpL[i ^ (1 << j)] + 1]]);
  dpR[0] = n + 1;
  for (int i = 1; i <= U; ++i) {
    dpR[i] = n + 1;
    for (int j = 0; j <= vi[0] - 1; ++j)
      if (i & (1 << j))
        dpR[i] = min(dpR[i], lb[j + 1][col[j + 1][dpR[i ^ (1 << j)] - 1]]);
  }
  for (int i = 1; i <= U; ++i)
    if (dpL[i] == n) {
      for (int i = 1; i <= n; ++i) printf("Possible\n");
      return 0;
    }
  for (int i = U - 1; i; i = (i - 1) & (U - 1)) {
    int j = U - 1 - i;
    if (col[1][dpL[i] + 1] == col[1][dpR[j] - 1]) vis[col[1][dpL[i] + 1]] = 1;
    swap(i, j);
    if (col[1][dpL[i] + 1] == col[1][dpR[j] - 1]) vis[col[1][dpL[i] + 1]] = 1;
    swap(i, j);
  }
  for (int i = 1; i <= n; ++i)
    if (vis[col[1][i]])
      printf("Possible\n");
    else
      printf("Impossible\n");
  return 0;
}
