#include <bits/stdc++.h>
// created [2019/11/16] 15:47:41
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }
template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }
template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }
template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};

template<typename T>
T read()
{
    T v;
    return std::cin >> v, v;
}
template<typename T, typename... Args>
auto read(const usize size, Args... args)
{
    std::vector<decltype(read<T>(args...))> ans(size);
    for (usize i = 0; i < size; i++) { ans[i] = read<T>(args...); }
    return ans;
}
template<typename... Types>
auto reads() { return std::tuple<std::decay_t<Types>...>{read<Types>()...}; }
#    define SHOW(...) static_cast<void>(0)

template<typename T>
std::vector<T> make_v(const usize size, const T v) { return std::vector<T>(size, v); }
template<typename... Args>
auto make_v(const usize size, Args... args) { return std::vector<decltype(make_v(args...))>(size, make_v(args...)); }
int main()
{
    const auto n = read<int>(), v = read<int>();
    const auto x = read<ll>(n);
    std::vector<int> vs{v};
    for (; vs.back() > 0;) { vs.push_back(vs.back() / 2); }
    SHOW(vs);
    const int jump = vs.size();
    SHOW(jump);
    auto right = make_v(jump, n, n);
    for (int i = 0; i < jump; i++) {
        for (int j = (int)n - 2; j >= 0; j--) {
            const ll dx = x[j + 1] - x[j];
            right[i][j] = (dx <= vs[i] ? right[i][j + 1] : j);
        }
    }
    SHOW(right);
    auto left = make_v(jump, n, -1);
    for (int i = 0; i < jump; i++) {
        for (int j = 1; j < n; j++) {
            const ll dx = x[j] - x[j - 1];
            left[i][j]  = (dx <= vs[i] ? left[i][j - 1] : j);
        }
    }
    SHOW(left);
    const int mask = 1 << jump;
    std::vector<int> rdp(mask, -1);
    for (int m = 0; m < mask; m++) {
        if (m != 0 and btest(m, 0)) { continue; }
        const int pos = rdp[m] + 1;
        for (int i = 1; i < jump; i++) {
            if (btest(m, i)) { continue; }
            if (rdp[m] == n - 1) {
                chmax(rdp[m | (1 << i)], rdp[m]);
                continue;
            }
            const int r = right[i][pos];
            chmax(rdp[m | (1 << i)], r);
        }
    }
    std::vector<int> ldp(mask, n);
    for (int m = 0; m < mask; m++) {
        if (m != 0 and btest(m, 0)) { continue; }
        const int pos = ldp[m] - 1;
        for (int i = 1; i < jump; i++) {
            if (btest(m, i)) { continue; }
            if (ldp[m] == 0) {
                chmin(ldp[m | (1 << i)], ldp[m]);
                continue;
            }
            const int l = left[i][pos];
            chmin(ldp[m | (1 << i)], l);
        }
    }
    SHOW(ldp, rdp);
    std::vector<int> ok(n, 0);
    for (int m = 0; m < mask; m++) {
        if (m != 0 and btest(m, 0)) { continue; }
        const int l = rdp[m];
        const int r = ldp[(mask - 2) - m];
        SHOW(m, l, r);
        if (l + 1 >= r) {
            std::fill(ok.begin(), ok.end(), 1);
            break;
        }
        const int r2 = right[0][l + 1 == n ? n - 1 : l + 1];
        const int l2 = left[0][r2];
        if (r2 + 1 >= r) {
            if (r2 + 1 < n) { ok[r2 + 1]--; }
            if (l2 + 1 < n) { ok[l2 + 1]++; }
        }
    }
    SHOW(ok);
    for (int i = 1; i < n; i++) { ok[i] += ok[i - 1]; }
    for (int i = 0; i < n; i++) { std::cout << (ok[i] > 0 ? "Possible" : "Impossible") << std::endl; }
    return 0;
}
