#define _GLIBCXX_IOSTREAM
#include<bits/stdc++.h>

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;

#define xx first
#define yy second

template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b){return a<b?a:b;}
template<typename T> inline T abs(T a){return a>0?a:-a;}
template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
template<typename T> inline T sqr(T x){return x*x;}
#define mp(a,b) std::make_pair(a,b)
#define pb push_back
#define I inline
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memcpy(a,b,sizeof(a))

#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define fd0(i,n) for(int i=(n)-1;~i;i--)
#define fd1(i,n) for(int i=n;i;i--)
#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define foe(i,x)for(__typeof(x.end())i=x.begin();i!=x.end();++i)

struct Cg{I char operator()(){return getchar();}};
struct Cp{I void operator()(char x){putchar(x);}};
#define OP operator
#define RT return *this;
#define RX x=0;char t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
#define RU x=0;char t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define TR *this,x;return x;
I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int &x)
{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char &x)
{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char *x){char t=P();for(;IS(t);t=P());if(~t){
for(;!IS(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf &x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf &x){RX;RL;RT}I OP llf(){llf x;TR}
I Fr&OP,(uint &x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull &x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
#define WI(S) if(x){if(x<0)P('-'),x=-x;char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)x=-x;\
while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
#define WU(S) if(x){char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}
I Fw&OP()(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char *x){while(*x)P(*x++);RT}
I Fw&OP()(const char *x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;

const int N=200007;

int n,m,s[N],id[20][N],idc;

inline void build(int*v,int x)
{
	fo1(i,n)
	{
		if(s[i]-s[i-1]>x)v[i]=++idc;
		else v[i]=v[i-1];
	}
}

std::list<int>son[N*20];

int g[30][30],tmp[30][30];

#include<ext/pb_ds/assoc_container.hpp>
//::unordered_map<uint,bool>hs;
__gnu_pbds::cc_hash_table<uint,bool>hs;

bool solve(int dep,int cnt)
{
	int*s=g[dep],uc=0;
	uint hash=dep;
	fo0(i,cnt)hash=hash*2337+s[i];
	if(hs.find(hash)!=hs.end())return hs[hash];
	//out,"solve:",dep,' ',cnt,'[';
	//fo0(i,cnt)printf("%d%c",s[i],i+1==cnt?']':' ');out,'\n';
	fo0(i,cnt)uc+=son[s[i]].size();
	if(dep==2)return uc<=1;
	if(uc>=dep)return 0;
	if(!uc)return 1;
	int*r=g[dep-1],*t=tmp[dep];
	uc=0;
	fo0(i,cnt)foe(j,son[s[i]])
		t[uc++]=*j;
	fo0(i,uc-1)r[i]=t[i+1];
	fo0(i,uc)
	{
		if(solve(dep-1,uc-1))return hs[hash]=1;
		r[i]=t[i];
	}
	return hs[hash]=0;
}

int main()
{
	in,n,m;
	s[0]=-2e9;
	fo1(i,n)in,s[i];
	int cnt=0;
	for(int j=m;;j>>=1)
	{
		build(id[cnt++],j);
		if(!j)break;
	}
	for(int i=cnt-1;i;i--)
	{
		fo1(j,n)
		{
			if(id[i][j]!=id[i][j-1])
			{
				son[id[i-1][j]].pb(id[i][j]);
			}
		}
	}
	int root=++idc;
	fo1(j,n)if(id[0][j]!=id[0][j-1])
		son[root].pb(id[0][j]);
	if(son[root].size()>cnt)
	{
		fo1(i,n)out,"Impossible\n";
		return 0;
	}
	//fo0(i,cnt){fo1(j,n)printf("%3d",id[i][j]);out,'\n';}
	bool ans;
	fo1(i,n)
	{
		if(id[0][i]!=id[0][i-1])
		{
			int u=0;
			foe(j,son[root])if(*j!=id[0][i])
				g[cnt][u++]=*j;
			ans=solve(cnt,u);
		}
		puts(ans?"Possible":"Impossible");
	}
}