#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int maxN = 2e5 + 2;
inline bool Chkmax(int& x, int y) { return x < y ? x = y, true : false; }
inline bool Chkmin(int& x, int y) { return x > y ? x = y, true : false; }
int n, v, cnt;
int SUC[maxN], ans[maxN];
int x[maxN], f[maxN << 1], g[maxN << 1];
vector<pii> line[20];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);
  cin >> n >> v;
  for (int i = 1; i <= n; ++i) cin >> x[i];
  do {
    int l = 1, r = 1;
    for (int j = 2; j <= n; ++j) {
      if (x[j] - (v >> cnt) > x[r]) {
        line[cnt].emplace_back(l, r);
        l = j;
      }
      r = j;
    }
    line[cnt].emplace_back(l, r);
  } while (v >> cnt++);
  --cnt;
  fill(f, f + (1 << cnt), -1);
  fill(g, g + (1 << cnt), n + 2);
  f[0] = 0, g[0] = n + 1;
  for (int i = 0; i < cnt; ++i)
    f[1 << i] = line[i + 1].begin()->second,
           g[1 << i] = line[i + 1].rbegin()->first;
  for (int i = 1; i < 1 << cnt; ++i)
    if (~f[i])
      for (int j = 1; j <= cnt; ++j)
        if (!(i >> (j - 1) & 1)) {
          auto pos =
              lower_bound(line[j].begin(), line[j].end(), pii(f[i] + 2, 0)) - 1;
          Chkmax(f[i | 1 << (j - 1)], pos->second);
        }
  for (int i = 1; i < 1 << cnt; ++i)
    if (g[i] != n + 2)
      for (int j = 1; j <= cnt; ++j)
        if (!(i >> (j - 1) & 1)) {
          auto pos = lower_bound(line[j].begin(), line[j].end(), pii(g[i], 0));
          if (pos != line[j].begin()) Chkmin(g[i | 1 << (j - 1)], --pos->first);
        }
  fill(SUC, SUC + n + 1, n + 2);
  for (int i = 0, all = (1 << cnt) - 1; i <= all; ++i)
    Chkmin(SUC[f[i]], g[all ^ i]);
  for (int i = n; i; --i) Chkmin(SUC[i - 1], SUC[i]);
  for (auto i : line[0]) {
    int flag = SUC[i.first - 1] <= i.second + 1;
    for (int j = i.first; j <= i.second; ++j)
      cout << (flag ? "Possible" : "Impossible") << endl;
  }
  return 0;
}
