#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) {cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl;}

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}
bool operator<(const TRI&_)const{return(fi==_.fi)?((se==_.se)?(th<_.th):(se<_.se)):(fi<_.fi);}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;

const int MAX_N = 200005;

ll x[MAX_N];
int v[18], l[MAX_N][18], r[MAX_N][18];
int dpl[1 << 18], dpr[1 << 18];
int team[MAX_N], ok[MAX_N];
P lr[MAX_N];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, V;
    cin >> n >> V;
    rep(i,n) cin >> x[i];
    int val = V, num = 0;
    while(val > 0){
        val >>= 1, v[num++] = val;
    }
    int st = 0, id = 0;
    rep(i,n){
        if(i == n-1){
            srep(k, st, n) team[k] = id;
            lr[id++] = {st, n-1};
        }else{
            if(x[i+1] - x[i] > V){
                srep(k, st, i + 1) team[k] = id;
                lr[id++] = {st, i};
                st = i + 1;
            }
        }
    }
    rep(j,num){
        int st = 0;
        rep(i,n){
            if(i == n-1){
                srep(k, st, n) r[k][j] = n-1;
            }else{
                if(x[i+1] - x[i] > v[j]){
                    srep(k, st, i + 1) r[k][j] = i;
                    st = i + 1;
                }
            }
        }
        st = n-1;
        rrep(i,n){
            if(i == 0){
                rep(k, st + 1) l[k][j] = 0;
            }else{
                if(x[i] - x[i-1] > v[j]){
                    srep(k, i, st + 1) l[k][j] = i;
                    st = i - 1;
                }
            }
        }
    }
    rep(i,(1 << num)){
        dpr[i] = -1, dpl[i] = n;
    }
    rep(i,(1 << num)){
        rep(j,num){
            if(!(i >> j & 1)){
                if(dpr[i] == n-1) dpr[i ^ (1 << j)] = n-1;
                else cmx(dpr[i ^ (1 << j)], r[dpr[i] + 1][j]);
                if(dpl[i] == 0) dpl[i ^ (1 << j)] = 0;
                else cmn(dpl[i ^ (1 << j)], l[dpl[i] - 1][j]);
            }
        }
    }
    rep(i,(1 << num)){
        int R = dpr[i], L = dpl[i^((1 << num) - 1)];
        if(L - R <= 1){
            rep(j,id) ok[j] = 1;
            break;
        }else{
            P p = lr[team[R + 1]];
            if(L - p.se <= 1) ok[team[R + 1]] = 1;
        }
    }
    rep(i,n){
        if(ok[team[i]]) cout << "Possible\n";
        else cout << "Impossible\n";
    }
    return 0;
}


Measured memory_bytes: 35200