#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
//#define int __int128
//#define ll __int128
typedef pair<int, int   > pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
//typedef complex<double> base;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < (int)(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;
#define mp(a, b) make_pair(a, b)

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";

template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}

ostream & operator << (ostream &out, pii a) {
    cout << a.first << " " << a.second ;
    return out;
}

void smain();

signed main() {

#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cout << setprecision(12) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

const int N = 1e5 + 10;

int parent[N];
int sz[N];
int lf[N], rf[N];
ll sm[N];
ll a[N];

void make_set(int v) {
    parent[v] = v;
    sz[v] = 1;
    lf[v] = rf[v] = v;
    sm[v] = a[v];
}

int find_set(int v) {
    return v == parent[v] ? v : parent[v] = find_set(parent[v]);
}

void union_sets(int u, int v) {
    u = find_set(u);
    v = find_set(v);
    if (u == v) return;
    if (sz[u] < sz[v]) swap(u, v);
    sz[u] += sz[v];
    inmin(lf[u], lf[v]);
    inmax(rf[u], rf[v]);
    parent[v] = u;
    sm[u] += sm[v];
}

ll len;
ll cur_val[N];


void smain() {

    set<pll> biggest;
    int n;
    cin >> n >> len;
    fori (i, n) {
        cin >> a[i];
        make_set(i);
    }
    for (int i = 0; i < n - 1; ++i) {
        cur_val[i] = a[i] + a[i + 1];
        biggest.insert({a[i] + a[i + 1], i});
    }
    vi ans;
    while (!biggest.empty()) {
        pll cur = *biggest.rbegin();
        biggest.erase(cur);
        if (cur.first < len) {
            cout << "Impossible";
            return;
        }
        int i = cur.second;
        union_sets(i, i + 1);
        ans.push_back(i);
        int u = find_set(i);
        if (lf[u] != 0) {
            biggest.erase({cur_val[lf[u] - 1], lf[u] - 1});
            cur_val[lf[u] - 1] = sm[find_set(lf[u] - 1)] + sm[u];
            biggest.insert({cur_val[lf[u] - 1], lf[u] - 1});
        }
        if (rf[u] != n - 1) {
            biggest.erase({cur_val[rf[u]], rf[u]});
            cur_val[rf[u]] = sm[u] + sm[find_set(rf[u] + 1)];
            biggest.insert({cur_val[rf[u]], rf[u]});
        }
    }
    cout << "Possible\n";
    reverse(ALL(ans));
    for (auto x : ans) {
        cout << x + 1 << "\n";
    }
}

Measured memory_bytes: 11008