// Slower C++ solution:
#include <iostream>

#include <set>

#include <queue>

#include <stack>

#include <vector>

#include <algorithm>

#include <map>

#include <chrono>

#include <math.h>

using namespace std;



using lli = long long int;

using Vint = std::vector<int>;

using Vlli = std::vector<lli>;

using Wint = std::vector<Vint>;

using Wlli = std::vector<Vlli>;

using Vbool = std::vector<bool>;

using pii = std::pair<int, int>;

using pll = std::pair<lli, lli>;



constexpr int MOD = 1e9 + 7;

constexpr int INFi = 2e9 + 1;

constexpr lli INFl = (lli)(9e18) + 1;

const vector<pii> DXDY = {std::make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1), make_pair(0, -1)};

constexpr char BR = '\n';



#define FOR(i, a, b) for(int (i) = (a); (i) < (b); (i)++)

#define FOReq(i, a, b) for(int (i) = (a); (i) <= (b); (i)++)

#define rFOR(i, a, b) for(int (i) = (b); (i) >= (a); i--)

#define FORstep(i, a, b, step) for(int (i) = (a); i < (b); i += (step))

#define REP(i, n) FOR(i, 0, n)

#define rREP(i, n) rFOR(i, 0, (n-1))

#define vREP(ele, vec) for(auto &(ele) : (vec))

#define vREPcopy(ele, vec) for(auto (ele) : (vec))

#define SORT(A) std::sort((A).begin(), (A).end())





template <class T> inline int argmin(vector<T> vec){return min_element(vec.begin(), vec.end()) - vec.begin();}

template <class T> inline int argmax(vector<T> vec){return max_element(vec.begin(), vec.end()) - vec.begin();}

template <class T> inline void chmax(T &a, T b){a = max(a, b);}

template <class T> inline void chmin(T &a, T b){a = min(a, b);}

inline int toInt(string &s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}

inline int toInt(const string s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}

inline long long int toLong(string &s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}

inline long long int toLong(const string s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}

template <class T> inline std::string toString(T n){

  if(n == 0) return "0";

  std::string res = "";

  if(n < 0){n = -n;while(n != 0){res += (char)(n % 10 + '0'); n /= 10;}

  std::reverse(res.begin(), res.end()); return '-' + res;}

  while(n != 0){res += (char)(n % 10 + '0'); n /= 10;} std::reverse(res.begin(), res.end()); return res;

}



// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~



constexpr int MAX_SIZE = 1e5 + 1;

int n, L;

Vint X(MAX_SIZE);





int judge(void){

   REP(i, n-1) if(X[i] + X[i + 1] >= L) return i;

   return -1;

}



int main(void){

  cin >> n >> L;

  REP(i, n) cin >> X[i];

  int u = judge();

  if(u == -1) std::cout << "Impossible" << BR;

  else{

    std::cout << "Possible" << BR;

    for(int i = 0; i != u; i++) std::cout << i + 1 << BR;

    for(int i = n-2; i != u; i--) std::cout << i + 1 << BR;

    std::cout << u + 1 << BR;

  }

  return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.4166274401250734x):
#include <iostream>

#include <list>

#include <set>

#include <deque>

#include <queue>

#include <stack>

#include <vector>

#include <algorithm>

#include <map>

#include <chrono>

#include <math.h>

using namespace std;



using lli = long long int;

using Vint = std::vector<int>;

using Vlli = std::vector<lli>;

using Wint = std::vector<Vint>;

using Wlli = std::vector<Vlli>;

using Vbool = std::vector<bool>;

using Wbool = std::vector<Vbool>;

using pii = std::pair<int, int>;

using pll = std::pair<lli, lli>;

template <class T>

using Vec = std::vector<T>;



constexpr int MOD = 1e9 + 7;

constexpr int INFi = 2e9 + 1;

constexpr lli INFl = (lli)(9e18) + 1;

const vector<pii> DXDY = {std::make_pair(1, 0), std::make_pair(-1, 0), std::make_pair(0, 1), std::make_pair(0, -1)};

constexpr char BR = '\n';



#define DEBUG(x) std::cerr << #x << " = " << x << '\n';

#define FOR(i, a, b) for(int (i) = (a); (i) < (b); ++(i))

#define FOReq(i, a, b) for(int (i) = (a); (i) <= (b); ++(i))

#define rFOR(i, a, b) for(int (i) = (b); (i) >= (a); --(i))

#define FORstep(i, a, b, step) for(int (i) = (a); i < (b); i += (step))

#define REP(i, n) FOR(i, 0, n)

#define rREP(i, n) rFOR(i, 0, (n-1))

#define vREP(ele, vec) for(auto &(ele) : (vec))

#define vREPcopy(ele, vec) for(auto (ele) : (vec))

#define SORT(A) std::sort((A).begin(), (A).end())

#define RSORT(A) std::sort((A).rbegin(), (A).rend())

#define ALL(A) (A).begin(), (A).end()

// 座標圧縮 (for vector) : ソートしてから使うのが一般的 ; SORT(A) => COORDINATE_COMPRESSION(A)

#define COORDINATE_COMPRESSION(A) (A).erase(unique((A).begin(),(A).end()),(A).end())







template <class T> inline int argmin(std::vector<T> vec){return min_element(vec.begin(), vec.end()) - vec.begin();}

template <class T> inline int argmax(std::vector<T> vec){return max_element(vec.begin(), vec.end()) - vec.begin();}

template <class S, class T> inline void chmax(S &a, T b){if(a < b) a = b;}

template <class S, class T> inline void chmin(S &a, T b){if(a > b) a = b;}

template <class T> inline void reverseSORT(Vec<T> &Array){

  std::sort(Array.begin(), Array.end(), std::greater<T>());

}

inline int BitI(int k){return 1 << k;}

inline lli BitL(int k){return 1LL << k;}

inline void putsDouble(double d){printf("%.16lf\n", d);}

inline int toInt(const string &s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}

inline long long int toLong(const string &s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}

template <class T> inline std::string toString(T n){

  if(n == 0) return "0";

  std::string res;

  if(n < 0){n = -n;while(n != 0){res += (char)(n % 10 + '0'); n /= 10;}

  std::reverse(res.begin(), res.end()); return '-' + res;}

  while(n != 0){res += (char)(n % 10 + '0'); n /= 10;} std::reverse(res.begin(), res.end()); return res;

}



// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~













int main(void){

    int n, L; scanf("%d%d", &n, &L);

    int h, t; scanf("%d", &t);

    int center = -1;

    REP(i, n-1){

        h = t; scanf("%d", &t);

        if(h + t >= L){

            center = i;

            break;

        }

    }

    if(center == -1) puts("Impossible");

    else{

        puts("Possible");

        REP(i, center) printf("%d\n", i+1);

        for(int i = n-1; i > center; i--) printf("%d\n", i);

    }

    return 0;

}