#include <set>
#include <map>
#include <queue>
#include <ctime>
#include <cmath>
#include <cstdio>
#include <bitset>
#include <vector>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;
typedef double db;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pa;
typedef unsigned int uint;
typedef unsigned long long ull;
#define w1 first
#define ls (x<<1)
#define w2 second
#define ins insert
#define rs (x<<1|1) 
#define mp make_pair
#define pb push_back
#define mid ((l+r)>>1)
#define sqr(x) ((x)*(x))
#define cle(x) ((x).clear())
#define lowbit(x) ((x)&(-x))
#define SZ(x) (int((x).size()))
#define All(x) (x).begin(),(x).end()
#define ms(x,y) memset(x,y,sizeof (x))
#define rep(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define rep2(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define per(i,a,b) for(int (i)=(a);(i)>=(b);(i)--)
#define Rep(p,x) for(int (p)=head[(x)];(p);(p)=nxt[(p)]) 
#define Rep2(p,x) for(int (p)=cur[(x)];(p);(p)=nxt[(p)])
template<class T>inline void read(T&num){
	num=0;T f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9')num=num*10+ch-'0',ch=getchar();
	num*=f;
}
inline int getgcd(int x,int y){if(!x)return y;return getgcd(y%x,x);}
inline int power(int x,int k,int p){int res=1;for(;k;k>>=1,x=(ll)x*x%p)if(k&1)res=(ll)res*x%p;return res;}
const double pi=acos(-1);	
inline void judge(){
	freopen("input.txt","r",stdin);
} 
//********************************head*************************************
const int maxn=1e6+5;
int n,m;
int v,x[maxn],rj[maxn][25],lj[maxn][25];
int lx[maxn],rx[maxn];
int mn[maxn];
int main(){
	read(n);read(v);
	rep(i,1,n)read(x[i]);
	while((1<<m)<=V)m++;m++;
	rep2(i,0,m){
		lj[0][i]=1;
		rep(j,1,n)lj[j][i]=(x[j]-x[j-1]<=(V>>i))?lj[j-1][i]:j;
		rj[n+1][i]=n;
		per(j,n,1)rj[j][i]=(x[j+1]-x[j]<=(V>>i))?rj[j+1][i]:j;
	}
	rep2(i,0,1<<m)rx[i]=n+1;
	rep2(i,0,1<<m)rep2(j,0,m)if(!(i&(1<<j))){
		lx[i|(1<<j)]=max(lx[i|(1<<j)],rj[lx[i]+1][j]);
		rx[i|(1<<j)]=min(rx[i|(1<<j)],lj[rx[i]-1][j]);
	}
	rep(i,0,n)mn[i]=n+2;
	rep2(i,0,1<<m)if(!(i&1))mn[lx[i]]=min(mn[lx[i]],rx[((1<<m)-1)^i^1]);
	per(i,n-1,0)mn[i]=min(mn[i],mn[i+1]);
	rep(i,1,n){
		if(mn[lj[i][0]-1]<=rj[i][0]+1)puts("Possible");
		else puts("Impossible");
	}
	return 0;
}