#include <bits/stdc++.h>
#pragma GCC target("sse4,tune=native")
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
template <typename T1, typename T2>
inline void chkmin(T1 &x, T2 y) {
  if (x > y) x = y;
}
template <typename T1, typename T2>
inline void chkmax(T1 &x, T2 y) {
  if (x < y) x = y;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const pair<T, U> &_p) {
  _out << _p.first << ' ' << _p.second;
  return _out;
}
template <typename T, typename U>
inline istream &operator>>(istream &_in, pair<T, U> &_p) {
  _in >> _p.first >> _p.second;
  return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const vector<T> &_v) {
  if (_v.empty()) {
    return _out;
  }
  _out << _v.front();
  for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) {
    _out << ' ' << *_it;
  }
  return _out;
}
template <typename T>
inline istream &operator>>(istream &_in, vector<T> &_v) {
  for (auto &_i : _v) {
    _in >> _i;
  }
  return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const set<T> &_s) {
  if (_s.empty()) {
    return _out;
  }
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
    _out << ' ' << *_it;
  }
  return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const multiset<T> &_s) {
  if (_s.empty()) {
    return _out;
  }
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
    _out << ' ' << *_it;
  }
  return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const unordered_set<T> &_s) {
  if (_s.empty()) {
    return _out;
  }
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
    _out << ' ' << *_it;
  }
  return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const unordered_multiset<T> &_s) {
  if (_s.empty()) {
    return _out;
  }
  _out << *_s.begin();
  for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) {
    _out << ' ' << *_it;
  }
  return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const map<T, U> &_m) {
  if (_m.empty()) {
    return _out;
  }
  _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')';
  for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) {
    _out << ", (" << _it->first << ": " << _it->second << ')';
  }
  return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const unordered_map<T, U> &_m) {
  if (_m.empty()) {
    return _out;
  }
  _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')';
  for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) {
    _out << ", (" << _it->first << ": " << _it->second << ')';
  }
  return _out;
}
const string FILENAME = "input";
const int MAXN = 200228;
int n, v;
int x[MAXN];
int add[MAXN];
int jumpl[20][MAXN], jumpr[20][MAXN];
int dpl[1 << 18], dpr[1 << 18];
int suff[1 << 18];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> v;
  for (int i = 0; i < n; i++) {
    cin >> x[i];
  }
  vector<int> st;
  while (v > 0) {
    st.push_back(v);
    v /= 2;
  }
  st.push_back(0);
  reverse((st).begin(), (st).end());
  for (int j = 0; j < (int)(st).size(); j++) {
    int uk = 0;
    for (int i = 0; i < n; i++) {
      if (uk < i) {
        uk = i;
      }
      while (uk + 1 < n && x[uk + 1] - x[uk] <= st[j]) {
        uk++;
      }
      jumpl[j][i] = uk;
    }
    uk = n - 1;
    for (int i = n - 1; i >= 0; i--) {
      if (uk > i) {
        uk = i;
      }
      while (uk > 0 && x[uk] - x[uk - 1] <= st[j]) {
        uk--;
      }
      jumpr[j][i] = uk;
    }
  }
  st.pop_back();
  for (int mask = 0; mask < (1 << (int)(st).size()); mask++) {
    if (mask == 0) {
      dpl[mask] = -1;
      dpr[mask] = n;
    } else {
      dpr[mask] = n;
      dpl[mask] = -1;
      for (int i = 0; i < (int)(st).size(); i++) {
        if (mask & (1 << i)) {
          if (dpl[mask ^ (1 << i)] == n - 1) {
            dpl[mask] = n - 1;
            break;
          }
          chkmax(dpl[mask], jumpl[i][dpl[mask ^ (1 << i)] + 1]);
        }
      }
      for (int i = 0; i < (int)(st).size(); i++) {
        if (mask & (1 << i)) {
          if (dpr[mask ^ (1 << i)] == 0) {
            dpr[mask] = 0;
            break;
          }
          chkmin(dpr[mask], jumpr[i][dpr[mask ^ (1 << i)] - 1]);
        }
      }
    }
  }
  dpl[0] = 0;
  dpr[0] = n - 1;
  vector<pair<int, int> > p;
  for (int mask = 0; mask < (1 << (int)(st).size()); mask++) {
    int l = dpl[mask];
    int r = dpr[mask ^ ((1 << (int)(st).size()) - 1)];
    p.push_back({l, r});
  }
  sort((p).begin(), (p).end());
  for (int j = (int)(p).size() - 1; j >= 0; j--) {
    suff[j] = p[j].second;
    if (j < (int)(p).size() - 1) {
      chkmin(suff[j], suff[j + 1]);
    }
  }
  for (int i = 0; i < n; i++) {
    int ll = jumpr[(int)(st).size()][i];
    int rr = jumpl[(int)(st).size()][i];
    int pos =
        lower_bound((p).begin(), (p).end(), make_pair(ll - 1, 0)) - p.begin();
    if (pos < (int)(p).size() && suff[pos] <= rr + 1) {
      cout << "Possible\n";
    } else {
      cout << "Impossible\n";
    }
  }
  return 0;
}
