#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

void debug(vector<vector<int>> &v) {
	cout << "!!" << endl;
	rep(i, v.size())rep(j, v[i].size()) {
		cout << i << " " << j << " " << v[i][j] << endl;
	}
}

int x[1 << 18];
int depth[1 << 18];

int merge(int a, int b) {
	int res = 0;
	int c = 0;
	rep(i, 20) {
		if (a&(1 << i))c++;
		if (b&(1 << i))c++;
		if (c > 0) {
			res += (1 << i); c--;
		}
	}
	return res;
}

bool isg(int a, int b) {
	int le = 0, ri = 0;
	per(i,20) {
		if (a&(1 << i))le++;
		if (b&(1 << i))ri++;
		if (le > ri)return false;
	}
	return true;
}
void add(vector<int> &v, int a) {
	bool valid = true;
	rep(i, v.size()) {
		if (isg(v[i], a)) {
			valid = false; break;
		}
	}
	if (!valid)return;
	vector<int> res;
	rep(i, v.size()) {
		if (!isg(a,v[i]))res.push_back(v[i]);
	}
	res.push_back(a);
	swap(v, res);
}
vector<vector<int>> merge(vector<vector<int>> &a, vector<vector<int>> &b) {
	vector<vector<int>> res(a.size());
	rep(i, a.size()) {
		rep(j, b.size()) {
			int k = i + j + 1;
			if (k >= a.size())continue;
			rep(x, a[i].size()) {
				rep(y, b[j].size()) {
					int u = merge(a[i][x], b[j][y]);
					add(res[k], u);
				}
			}
		}
	}
	return res;
}

vector<vector<int>> dfs(int l, int r, int v) {
	if (v == 0) {
		return{ {1} };
	}
	//cout << l << " " << r << " " << v << endl;
	vector<int> nex;
	Rep1(i, l, r) {
		int le = i;
		while (i + 1 <= r&&x[i + 1] - x[i] <= v/2)i++;
		nex.push_back(le);
	}
	nex.push_back(r+1);
	int len = nex.size() - 1;
	//cout << len << endl;
	if (len == 1) {
		vector<vector<int>> ch = dfs(l, r, v / 2);
		ch.resize(depth[v] + 1);
		return ch;
	}
	vector<vector<int>> res(depth[v] + 1);
	//res[0].push_back((1 << depth[v]));
	if (len > depth[v]+1) {
		res[0].push_back(1 << depth[v]);
		return res;
	}
	bool upd = false;
	rep(i, len) {
		int le = nex[i], ri = nex[i + 1] - 1;
		vector<vector<int>> ch = dfs(le, ri, v / 2);
		if (!upd) {
			res = ch; res.push_back({});
			upd = true;
		}
		else res = merge(res, ch);
	}
	//cout << l << " " << r << " " << v << endl;
	//debug(res);
	add(res[0], (1 << depth[v]));
	return res;
}

void solve() {
	int n, v;
	cin >> n >> v;
	rep(i, n)cin >> x[i];
	vector<int> z;
	int cop = v;
	while (cop > 0) {
		z.push_back(cop); cop >>= 1;
	}
	z.push_back(0);
	reverse(all(z));
	rep(i, z.size()) {
		depth[z[i]] = i;
	}

	/*cout << "start" << endl;
	vector<vector<int>> ex = dfs(12, 15, 9); 
	cout << "end" << endl;
	debug(ex);
	ex = dfs(12, 15, 4); debug(ex);*/


	vector<int> nex;
	rep(i, n) {
		nex.push_back(i);
		while (i + 1 < n&&x[i + 1] - x[i] <= v)i++;
	}
	nex.push_back(n);
	int len = nex.size() - 1;
	if (len > depth[v]+1) {
		rep(i, n) {
			cout << "impossible" << endl;
		}
		return;
	}
	if (len == 1) {
		rep(i, n) {
			cout << "Possible" << endl;
		}
		return;
	}
	vector<vector<vector<int>>> memo;

	rep(i, len) {
		int le = nex[i], ri = nex[i + 1] - 1;
		vector<vector<int>> ch = dfs(le, ri, v);
		memo.push_back(ch);
	}
	vector<vector<vector<int>>> le(len+1), ri(len+1);
	le[0].resize(depth[v] + 1);
	ri[len].resize(depth[v] + 1);
	le[1] = memo[0];
	rep1(i, len-1) {
		le[i + 1] = merge(le[i], memo[i]);
	}
	ri[len - 1] = memo[len - 1];
	per(i, len-1) {
		ri[i] = merge(ri[i + 1], memo[i]);
	}
	vector<bool> ans(n);
	rep(i, len) {
		vector<vector<int>> m;
		if (i == 0)m = ri[1];
		else if (i == len - 1)m = le[i];
		else m = merge(le[i], ri[i + 1]);

		bool f = false;
		//cout << "hello "<<i << endl;
		rep(j, m.size()) {
			rep(k, m[j].size()) {
				//cout << j << " " << k << " " << m[j][k] << endl;
				if (m[j][k] & (1 << depth[v]))continue;
				f = true;
			}
		}
		if (f) {
			Rep(j, nex[i], nex[i + 1])ans[j] = true;
		}
	}
	rep(i, n) {
		if (ans[i])cout << "Possible" << endl;
		else cout << "Impossible" << endl;
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(7);
	//init();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}


Measured memory_bytes: 3400