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
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; cin>>_tests; FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;
#define SIZE(coll) 					((int)coll.size())

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int n, k, a;
bitset <50005> bs, out;
vector <pair<int, pair<int, int>>> res;

int solve()
{
    cin >> n >> k;
    forr(i, k)
    {
        cin >> a;
        out[a] = 1;
    }

    res.PB({3, {1, -1}});

    int last = n+1;
    FOR(i, 1, n)
        if(bs[i] != out[i])
        {
            if(bs[i] == 0)
            {
                res.PB({1, {last, i}});
                last++;
                for(int j = i; j <= n; j++)
                    bs[j] = 1;
            }
            else
            {
                res.PB({3, {i, -1}});
                res.PB({2, {last, last+1}});
                last += 2;
                for(int j = i; j <= n; j++)
                    bs[j] = 0;
            }
        }

    //cout << bs << '\n';

    cout << res.size() << '\n';
    for(auto p : res)
    {
        cout << p.ff << " " << p.ss.ff;
        if(p.ff != 3) 
            cout << " " << p.ss.ss;
        cout << '\n';
    }

    return 0;
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return 0;
}