#include <bits/stdc++.h>
using namespace std;
long long n, v, lg, d[200010], a[30][200010], f1[1 << 20], f2[1 << 20];
long long g1(long long *a, long long x) {
  long long l = 1, r = a[0];
  while (l + 1 < r) {
    long long md = (l + r) / 2;
    if (a[md] <= x)
      l = md + 1;
    else
      r = md;
  }
  if (a[l] > x) return a[l];
  return a[r];
}
long long g2(long long *a, long long x) {
  long long l = 1, r = a[0];
  while (l + 1 < r) {
    long long md = (l + r) / 2;
    if (a[md] < x)
      l = md;
    else
      r = md - 1;
  }
  if (a[r] < x) return a[r] + 1;
  return a[l] + 1;
}
signed main() {
  cin >> n >> v;
  while ((1 << lg) <= v) lg++;
  lg++;
  for (long long i = 1; i <= n; i++) cin >> d[i];
  d[n] = 0;
  for (long long i = 1; i <= n; i++) d[i - 1] = d[i] - d[i - 1];
  for (long long i = 1; i <= lg; i++) {
    a[i][0] = 1;
    for (long long j = 1; j <= n; j++) {
      a[i][a[i][0]] = j;
      if (d[j] > (v >> (i - 1))) a[i][0]++;
    }
  }
  if (a[1][0] > lg) {
    for (long long i = 1; i <= n; i++) puts("Impossible");
    return 0;
  }
  for (long long i = 0; i < (1 << lg); i++) f2[i] = n + 1;
  for (long long i = 0; i < (1 << lg); i += 2)
    for (long long j = 2; j <= lg; j++)
      if (!(i & (1 << (j - 1)))) {
        f1[i + (1 << (j - 1))] = max(f1[i + (1 << (j - 1))], g1(a[j], f1[i]));
        f2[i + (1 << (j - 1))] =
            min(f2[i + (1 << (j - 1))], g2(a[j], f2[i] - 1));
      }
  for (long long i = 1; i <= a[1][0]; i++) {
    long long ok = 0;
    long long l = a[1][i - 1] + 1, r = a[1][i];
    if (i == 1) l = 1;
    for (long long s = 0; s < (1 << lg); s += 2)
      if (l <= f1[s] + 1 && f2[(1 << lg) - s - 2] <= r + 1) ok = 1;
    if (ok)
      for (long long j = l; j <= r; j++) puts("Possible");
    else
      for (long long j = l; j <= r; j++) puts("Impossible");
  }
}
