1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<queue>
#include<stack>
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<VLL > VVLL;
typedef vector<VLD > VVLD;
typedef vector<PII > VPII;
typedef __int128 int128;
template<class TIn>
using indexed_set = tree<
        TIn, null_type, less<TIn>,
        rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define THIS (*this)
#define LSB(x) (x & -x)
#define SQR(x) ((x)*(x))

const int INF = 1e9;

int getMin(set<int> &s) {
    if (s.empty()) return INF;
    return *s.begin();
}

int main() {
	ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    int n, s;
    cin >> n >> s;
    set<int> cs, ts;
    REP(i, s) {
        int b; cin >> b;
        ts.insert(b);
    }
    int i = getMin(ts);
    ts.erase(i);
    int x = i + i;
    while (x <= n) {
        cs.insert(x);
        x += i;
    }
    VI t;
    VPII p;
    while (!ts.empty() || !cs.empty()) {
        int cm = getMin(cs);
        int tm = getMin(ts);
        if (cm == tm) {
            cs.erase(cm);
            ts.erase(tm);
        } else if (tm < cm) {
            t.PB(1);
            p.PB({i, tm});
            i = p.size() + n;
            x = tm + tm;
            while (x <= n) {
                cs.insert(x);
                x += tm;
            }
            ts.erase(tm);
        } else {
            t.PB(3);
            p.PB({cm, 0});
            t.PB(2);
            p.PB({p.size() + n, i});
            i = p.size() + n;
            x = cm;
            while (x <= n) {
                cs.erase(x);
                x += cm;
            }
        }
    }
    cout << t.size() << '\n';
    REP(i, t.size()) {
        cout << t[i] << ' ';
        if (t[i] == 3) cout << p[i].ST << '\n';
        else cout << p[i].ST << ' ' << p[i].ND << '\n';
    }

    return 0;
}