#include <bits/stdc++.h>
using namespace std;
void _dbg(string) { cerr << endl; }
template <class H, class... T>
void _dbg(string s, H h, T... t) {
  int l = s.find(',');
  cerr << s.substr(0, l) << " = " << h << ", ";
  _dbg(s.substr(l + 1), t...);
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &p) {
  o << "(" << p.first << "," << p.second << ")";
  return o;
}
template <class T>
ostream &operator<<(ostream &o, const vector<T> &v) {
  o << "[";
  for (T t : v) {
    o << t << ",";
  }
  o << "]";
  return o;
}
int n, lv;
int c[19][200005];
bool dfs(int mask, int cur, int target) {
  if (cur == target) return true;
  for (int i = (int)(1); i < (int)(lv); i++)
    if ((mask >> i) % 2 == 0 && c[i][(cur - 1 + n) % n] != c[i][cur]) {
      if (dfs(mask + (1 << i), (c[i][cur] + 1) % n, target)) return true;
    }
  return false;
}
int main() {
  int v;
  cin >> n >> v;
  vector<int> a(n);
  for (int i = (int)(0); i < (int)(n); i++) cin >> a[i];
  lv = 33 - __builtin_clz(v);
  for (int i = 0, tv = v; i < lv; i++, tv /= 2) {
    int p = n - 1;
    c[i][n - 1] = n - 1;
    for (int j = n - 2; j >= 0; j--) {
      if (a[j + 1] - a[j] > tv) p = j;
      c[i][j] = p;
    }
  }
  set<int> x;
  for (int i = (int)(0); i < (int)(n); i++) x.insert(c[0][i]);
  if (x.size() > lv) {
    for (int i = (int)(0); i < (int)(n); i++) cout << "Impossible\n";
    return 0;
  }
  for (int i = (int)(0); i < (int)(n); i++) {
    bool res = dfs(1, (c[0][i] + 1) % n, i);
    for (int j = (int)(i); j < (int)(c[0][i] + 1); j++)
      cout << (res ? "Possible" : "Impossible") << "\n";
    i = c[0][i];
  }
  return 0;
}
