#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define dep(i,a,b) for(int i=a;i>=b;i--)
#define ll long long
#define mem(x,num) memset(x,num,sizeof x)
#define reg(x) for(int i=last[x];i;i=e[i].next)
using namespace std;
inline ll read(){
	ll f=1,x=0;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
//**********head by yjjr**********
const int maxn=2e5+6;
int n,v,tot=-1,bin[26],R[26][maxn],num[26],f1[maxn<<2],f2[maxn<<2],a[maxn];
int main()
{
	n=read(),v=read();bin[0]=1;
	rep(i,1,20)bin[i]=bin[i-1]<<1;
	rep(i,1,n)a[i]=read();int x=v*2;
	while(x){
		x>>=1,tot++;
		rep(i,1,n-1){
			if(a[i+1]-a[i]<=x)continue;
			R[tot][++num[tot]]=i;
		}
		R[tot][++num[tot]]=n;
	}
	if(num[0]>tot+1){
		rep(i,1,n)puts("Impossible");
		return 0;
	}
	rep(s,0,bin[tot]-1)f2[s]=n+1;
	rep(s,0,bin[tot]-1)
        rep(i,1,tot){
            if(s&bin[i-1])continue;
            f1[s|bin[i-1]]=max(f1[s|bin[i-1]],*upper_bound(R[i]+1,R[i]+num[i]+1,f1[s]));
            f2[s|bin[i-1]]=min(f2[s|bin[i-1]],R[i][lower_bound(R[i]+1,R[i]+num[i]+1,f2[s]-1)-R[i]-1]+1);
        }
	rep(i,1,num[0]){
        bool flag=0;
        rep(s,0,bin[tot]-1)
            if(f1[s]>=R[0][i-1]&&f2[bin[tot]-1-s]<=R[0][i]+1){flag=1;break;}
        rep(j,R[0][i-1]+1,R[0][i]){
			if(flag)puts("Possible");else puts("Impossible");
		}
    }
	return 0;
}