#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
#include<iomanip>
#include<list>
#include <numeric>
using namespace std;
typedef unsigned long long int ulint;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define RE return 0
//ios::sync_with_stdio(false);
//std::cin.tie(0);
//<< setprecision(20)
const int mod=(int)1000000007;
const llint big=(llint)(2.19e16)+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double ena=2.71828182845904523536;
const long double eps=1e-7;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
template <class T> void soun(T& ar)
{sort(ar.begin(),ar.end());ar.erase(unique(ar.begin(),ar.end()),ar.end());}
llint gcd(llint a,llint b){if(a%b==0){return b;}else{return gcd(b,a%b);}}
llint lcm(llint a,llint b){return a/gcd(a,b) *b;}
template<class T,class U> auto LB(T& ve,U in){return lower_bound(ve.begin(),ve.end(),in);}
template<class T,class U> auto UB(T& ve,U in){return upper_bound(ve.begin(),ve.end(),in);}
template<class T,class U> auto LBI(T& ve,U in){return LB(ve,in)-ve.begin();}
template<class T,class U> auto UBI(T& ve,U in){return UB(ve,in)-ve.begin();}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
using pli=pair<llint,int>;
using daic=priority_queue<pli,vector<pli>,greater<pli>>;
int main(void){
	int n,v,i,j,k;cin>>n>>v;
	int mae,ju=0;cin>>mae;
	vector<int>sa(n-1);
	for(i=0;i<n-1;i++){
		int x;cin>>x;
		sa[i]=x-mae;
		if(x-mae>v){ju++;}
		mae=x;
	}
	k=v;
	vector<int>kobu;
	while(k>0){
		k/=2;
		kobu.pub(k);
	}
	int ks=kobu.size();//vは特別
	if(kobu.size()+2<ju){
		//不可能であることが確定する枝刈り
		for(i=0;i<n;i++){cout<<"Impossible"<<endl;}
		RE;
	}
	vector<vector<int>>made(ks,vector<int>(n)) ;//0~ どこまで
	vector<vector<int>>hade(ks,vector<int>(n)) ;//どこまで~n-1
	for(k=0;k<ks;k++){
		int gen=0;hade[k][0]=0;
		for(i=0;i<n-1;i++){
			if(kobu[k]<sa[i]){gen=i+1;}
			hade[k][i+1]=gen;
		}
		gen=n-1;made[k][n-1]=n-1;
		for(i=n-2;i>=0;i--){
			if(kobu[k]<sa[i]){gen=i;}
			made[k][i]=gen;
		}
	}
	vector<int>mdp(1<<ks,  0);
	vector<int>hdp(1<<ks,n-1);
	for(int bi=0;bi<(1<<ks);bi++){
		for(int i=0;i<ks;i++){
			if((bi&(1<<i))==0){continue;}
			
			if(mdp[bi-(1<<i)]==n-1){mdp[bi]=n-1;}
			else{maxeq(mdp[bi],made[i][mdp[bi-(1<<i)]+1]);}
			
			if(hdp[bi-(1<<i)]==0){hdp[bi]=0;}
			else{mineq(hdp[bi],hade[i][hdp[bi-(1<<i)]-1]);}
		}
	}
	//点を見つける
	mae=0;int cha=0;
	for(i=0;i<n;i++){
		cha++;
		if(i==n-1||sa[i]>v){
			string ret="Impossible";
			for(int bi=0;bi<(1<<ks);bi++){
				if(mae<=mdp[bi]+1&&hdp[(1<<ks)-1-bi]-1<=i){ret="Possible";break;}
			}
			while(cha>0){cout<<ret<<endl;cha--;}
			mae=i+1;
		}
	}RE;
}