#include <bits/stdc++.h>
using namespace std;
const int N = 262244, M = 22, mod = 1e9 + 7;
template <class T>
inline void gmin(T &x, const T &y) {
  if (x > y) x = y;
}
template <class T>
inline void gmax(T &x, const T &y) {
  if (x < y) x = y;
}
inline void ch(int &x, int y) { x = (x + y) % mod; }
template <class T>
inline void read(T &x) {
  x = 0;
  char ch = getchar(), rev = 0;
  while (ch > '9' || ch < '0') rev = (ch == '-'), ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  x = rev ? -x : x;
}
template <class T>
inline void print(T x) {
  if (!x) {
    puts("0");
    return;
  }
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  int a[20], m = 0;
  while (x) a[m++] = x % 10, x /= 10;
  while (m--) putchar(a[m] + '0');
  puts("");
}
inline int exp(int x, int y) {
  int ans = 1;
  while (y) {
    if (y & 1) ans = (long long)ans * x % mod;
    x = (long long)x * x % mod;
    y >>= 1;
  }
  return ans;
}
int n, m, a[N], v[20], l[20][N], r[20][N], f[N], g[N];
void solve(int x) {
  for (int i = 1; i <= n; i++) {
    int t = i;
    while (t < n && a[t + 1] - a[t] <= v[x]) t++;
    for (int j = i; j <= t; j++) l[x][j] = t + 1, r[x][j] = i - 1;
    i = t;
  }
  l[x][n + 1] = n + 1;
  r[x][0] = 0;
}
int main() {
  ios::sync_with_stdio(0);
  read(n);
  read(v[0]);
  for (int i = 1; i <= n; i++) read(a[i]);
  for (int j = 1; v[j - 1]; j++, m = j) v[j] = v[j - 1] >> 1;
  for (int i = 0; i < m; i++) solve(i);
  f[0] = 1;
  g[0] = n;
  for (int i = 2; i < (1 << m); i += 2) {
    f[i] = 1, g[i] = n;
    for (int j = 1; j < m; j++)
      if (i & (1 << j))
        gmax(f[i], l[j][f[i ^ (1 << j)]]), gmin(g[i], r[j][g[i ^ (1 << j)]]);
  }
  int u = (1 << m) - 2;
  for (int i = 1; i <= n; i++) {
    int r = i, isok = 0;
    while (r < n && a[r + 1] - a[r] <= v[0]) r++;
    for (int j = 0; j < (1 << m); j += 2)
      if (f[j] >= i && g[u ^ j] <= r) isok = 1;
    for (int j = i; j <= r; j++)
      if (isok)
        puts("Possible");
      else
        puts("Impossible");
    i = r;
  }
  return 0;
}
