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
#include <bits/stdc++.h>
using namespace std;
#define fwd(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) fwd(i, 0, n)
#define all(X) X.begin(), X.end()
#define sz(X) int(size(X))
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
using pii = pair<int, int>; using vi = vector<int>;
using ll = long long; using ld = long double;
#ifdef LOC
auto SS = signal(6, [](int) { *(int *)0 = 0; });
#define DTP(x, y) auto operator<<(auto &o, auto a) -> decltype(y, o) { o << "("; x; return o << ")"; }
auto operator<<(auto &o, auto a) -> decltype(all(a), o);
DTP(o << a.st << ", " << a.nd, a.nd);
DTP(for (auto i : a) o << i << ", ", all(a));
#define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", [](auto... arg_) { (( cerr << arg_ << ", " ), ...) << '\n'; }(x)
#else
#define deb(...) 0
#endif

void solve() {
    int n, s;
    cin >> n >> s;

    vi curr(n+1), goal(n+1);
    curr[n] = n;
    int last = n;
    rep(_, s) {
        int x;
        cin >> x;
        goal[x] = true;
    }

    vector<array<int, 3>> ops;

    rep(i, sz(curr)) {
        if (curr[i] == goal[i]) continue;

        if (goal[i]) {
            for (int j = i; j <= n; j += i) curr[j] = true;
            ops.pb({1, last, i});
            last++;
            continue;
        }

        for (int j = i; j <= n; j += i) curr[j] = false;
        ops.pb({3, i});
        ops.pb({2, last, last + 1});
        last += 2;
        continue;
    }

    cout << sz(ops) << '\n';
    for (auto [x, y, z] : ops) {
        cout << x << ' ' << y;
        if (x != 3) cout << ' ' << z;
        cout << '\n';
    }
}

int32_t main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(10);

    int z = 1;
    // cin >> z;
    rep(_, z) solve();

    cout << flush;
    _Exit(0);
}