// by saubguiu a normal one.

#include <bits/stdc++.h>
using namespace std;

#define inline __inline__ __attribute__ ((always_inline))

inline void o_1 (int x){ printf ("1 %d\n", x); } // fill
inline void o_2 (int x){ printf ("2 %d\n", x); } // pour out
inline void o_3 (int x, int y){ printf ("3 %d %d\n", x, y); }

const int N = 10, V = 2e4;
int n, A, a[N + 5], I, pre[V + 5];

signed main (){
    scanf ("%d%d", &n, &A);
    int w = 0;
    for (int i = 1;i <= n;++ i){
        scanf ("%d", &a[i]);
        if (a[i] > a[I]) I = i;
        if (w == 0) w = a[i];
        else w = __gcd (w, a[i]);
    }
    if (A > a[I] || A % w != 0) return puts ("-1"), 0;
    if (A == a[I]) return printf ("1\n1 %d\n", I), 0;
    pre[0] = 1;
    queue < int > Q; Q.push (0);
    while (! Q.empty ()){
        int u = Q.front (); Q.pop ();
        for (int i = 1;i <= n;++ i)
            if (i != I && ! pre[(u + a[i]) % a[I]]){
                pre[(u + a[i]) % a[I]] = i;
                Q.push ((u + a[i]) % a[I]);
            }
    }
    auto output = [] (auto self, int x, int cnt) -> void {
        if (! x) printf ("%d\n", cnt);
        else if (a[pre[x]] <= x){
            self (self, x - a[pre[x]], cnt + 2);
            o_1 (pre[x]), o_3 (pre[x], I);
        } else {
            self (self, x + a[I] - a[pre[x]], cnt + 4);
            o_1 (pre[x]), o_3 (pre[x], I);
            o_2 (I), o_3 (pre[x], I);
        }
        return void ();
    };
    output (output, A, 0);

    return 0;
}