// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 2e5 + 5;
const int MAXL = 19;
const int MAXS = (1 << MAXL) + 5;

int N, V;
int A[MAXN];

void input()
{
    read(N); read(V);
    for (int i = 1; i <= N; ++i) {
        read(A[i]);
    }
}

int L;
vector<Pii> interval[MAXL];

void solve()
{
    for (int v = V; ; v >>= 1) {
        int st = 1;
        for (int i = 1; i <= N; ++i) {
            if (i == N || A[i+1] - A[i] > v) {
                interval[L].push_back(MP(st, i));
                st = i + 1;
            }
        }
        ++L;
        if (!v)
            break;
    }

    static int rbnd[MAXL][MAXN], lbnd[MAXL][MAXN];

    for (int i = 0; i < L; ++i) {
        rbnd[i][N+1] = N;
        lbnd[i][0] = 1;
        for (auto x: interval[i]) {
            for (int j = x.x; j <= x.y; ++j) {
                rbnd[i][j] = x.y;
                lbnd[i][j] = x.x;
            }
        }
    }

    static int f[MAXS], g[MAXS];
    int sbnd = 1 << (L - 1);

    for (int s = 0; s < sbnd; ++s) {
        f[s] = 0; g[s] = N + 1;
        for (int i = 1; i < L; ++i) {
            if (s >> (i - 1) & 1) {
                chkmax(f[s], rbnd[i][f[s^(1<<(i-1))]+1]);
                chkmin(g[s], lbnd[i][g[s^(1<<(i-1))]-1]);
            }
        }
    }

    vector<Pii> cover;

    for (int s = 0; s < sbnd; ++s) {
        cover.push_back(MP(f[s], g[(sbnd-1)^s]));
        if (f[s] + 1 >= g[(sbnd - 1) ^ s]) {
            for (int i = 1; i <= N; ++i) {
                puts("Possible");
            }
            return;
        }
    }
    std::sort(ALL(cover));
    cover.resize(std::unique(ALL(cover)) - cover.begin());

    static Pii q[MAXN];
    int front = 0, rear = 0;

    for (int i = 1, j = 0; i <= N; ++i) {
        int l = lbnd[0][i], r = rbnd[0][i];
        for (; j < SZ(cover) && cover[j].x < r; ++j) {
            while (front < rear && q[rear-1].y >= cover[j].y) --rear;
            q[rear++] = cover[j];
        }
        while (front < rear && q[front].x + 1 < l) ++front;
        if (front < rear && q[front].y - 1 <= r)
            puts("Possible");
        else
            puts("Impossible");
    }
}

int main()
{
#ifdef __DEBUG
    freopen("E.in", "r", stdin);
    freopen("E.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 时光只解催人老，不信多情，长恨离亭，泪滴春衫酒易醒。
//     -- 晏殊《采桑子·时光只解催人老》


Measured memory_bytes: 42416