#include <bits/stdc++.h>
using namespace std;
void Debug() { cout << '\n'; }
template <class FIRST, class... REST>
void Debug(FIRST arg, REST... rest) {
  cout << arg << " ";
  Debug(rest...);
}
template <class T>
ostream& operator<<(ostream& out, const vector<T>& v) {
  out << "[";
  if (!v.empty()) {
    for (int i = int(0); i < int((int)(v).size() - 1); i++) out << v[i] << ", ";
    out << v.back();
  }
  out << "]";
  return out;
}
template <class S, class T>
ostream& operator<<(ostream& out, const pair<S, T>& v) {
  out << "(" << v.first << ", " << v.second << ")";
  return out;
}
const int MAX_N = 200010;
const int MAX_V = 100010;
const double eps = 1e-6;
const long long mod = 1000000007;
const int inf = 1 << 29;
const long long linf = 1LL << 60;
const double PI = 3.14159265358979323846;
int N, V;
int M, SM;
int T[21][MAX_N];
int nex[21][MAX_N];
int dp[MAX_N], rdp[MAX_N];
int ok[MAX_N];
vector<int> v;
long long A[MAX_N];
void pre(int dp[MAX_N]) {
  for (int i = int(0); i < int(M); i++) {
    for (int j = int(0); j < int(N - 1); j++) {
      T[0][j] = (abs(A[j + 1] - A[j]) > v[i]) ? j : (j + 1);
    }
    T[0][N - 1] = N - 1;
    for (int q = int(0); q < int(20); q++) {
      for (int j = int(0); j < int(N); j++) {
        T[q + 1][j] = T[q][T[q][j]];
      }
    }
    for (int j = int(0); j < int(N); j++) {
      nex[i][j] = T[20][j];
    }
  }
  for (int bit = int(0); bit < int((1 << SM)); bit++) {
    if (dp[bit] == N - 1) continue;
    for (int i = int(0); i < int(N); i++) {
      if (bit & (1 << i)) continue;
      dp[bit | (1 << i)] = max(dp[bit | (1 << i)], nex[i][dp[bit] + 1]);
    }
  }
  for (int bit = int(0); bit < int((1 << SM)); bit++) {
    if (dp[bit] == N - 1) continue;
    dp[bit] = nex[SM][dp[bit] + 1];
  }
}
void solve() {
  cin >> N >> V;
  for (int i = int(0); i < int(N); i++) cin >> A[i];
  while (V >= 1) {
    v.push_back(V);
    V /= 2;
  }
  v.push_back(0);
  M = (int)(v).size();
  SM = M - 1;
  reverse((v).begin(), (v).end());
  pre(dp);
  reverse(A, A + N);
  pre(rdp);
  for (int bit = int(0); bit < int((1 << SM)); bit++)
    rdp[bit] = N - 1 - rdp[bit];
  for (int bit = int(0); bit < int((1 << SM)); bit++) {
    int rbit = (1 << SM) - 1 - bit;
    int l = dp[bit], r = rdp[rbit];
    l++;
    if (l > r) {
      ok[l]--;
      ok[r]++;
    }
  }
  for (int i = int(0); i < int(N); i++) {
    ok[i + 1] += ok[i];
    if (ok[i])
      cout << "Possible\n";
    else
      cout << "Impossible\n";
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed;
  cout.precision(20);
  srand((unsigned int)time(NULL));
  solve();
  return 0;
}
