#include <bits/stdc++.h>
using namespace std;

#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ll isqrt(ll k) {ll r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
#define db(x) cout << #x << " = " << (x) << "\n";

const int maxn = 2e5 + 5;
const int logn = 20;
int n;
int v[logn];
int x[maxn];
int nxt[logn][maxn];
int prv[logn][maxn];
int f[1 << logn];
int g[1 << logn];
int cnt[maxn];

void solve() {
	cin >> n >> v[0];
	FOR(i, 0, n) cin >> x[i];
	int limit = 1;
	for (int i = 0; i < logn && v[i]; i++) v[i + 1] = v[i] >> 1, limit++;
	FOR(k, 0, limit) {
		nxt[k][n - 1] = n - 1;
		FORd(i, n - 1, 0) {
			nxt[k][i] = i;
			if (x[i + 1] - x[i] <= v[k]) {
				nxt[k][i] = nxt[k][i + 1];
			}
		}
		prv[k][0] = 0;
		FOR(i, 1, n) {
			prv[k][i] = i;
			if (x[i] - x[i - 1] <= v[k]) {
				prv[k][i] = prv[k][i - 1];
			}
		}
	}
	fill_n(f, 1 << limit, -1), fill_n(g, 1 << limit, n);
	FOR(msk, 1, 1 << limit) {
		FOR(i, 0, limit) if (bit(msk, i)) {
			int nmsk = msk ^ (1 << i);
			if (f[nmsk] == n - 1) {
				f[msk] = n - 1;
			}
			else {
				chkmax(f[msk], nxt[i][f[nmsk] + 1]);
			}
			if (g[nmsk] == 0) {
				g[msk] = 0;
			}
			else {
				chkmin(g[msk], prv[i][g[nmsk] - 1]);
			}
		}
	}
	FOR(msk, 0, 1 << limit) if (!bit(msk, 0)) {
		int pmsk = (1 << limit) - 1 ^ msk ^ 1;
		int x = f[msk] + 1;
		if (nxt[0][x] + 1 >= g[pmsk]) {
			cnt[x]++, cnt[nxt[0][x] + 1]--;
		}
	}
	FOR(i, 1, n) cnt[i] += cnt[i - 1];
	FOR(i, 0, n) {
		if (cnt[i]) {
			cout << "Possible\n";
		}
		else {
			cout << "Impossible\n";
		}
	}
}

int main() {
	ios_base::sync_with_stdio(0); //cin.tie(0);
#ifdef _LOCAL_
	freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout);
#endif
	solve();
#ifdef _LOCAL_
	//printf("\nTime elapsed: %dms", 1000 * clock() / CLOCKS_PER_SEC);
#endif
	return 0;
}

Measured memory_bytes: 43392