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
#include <iostream>
#include <vector>
#include <map>

using namespace std;

struct Op
{
	int o, a, b;

};

int b[50000];

int main()
{
	int n, s;

	cin >> n >> s;
	vector<Op> d;
	d.reserve(2 * n);

	for (int i = 0; i < s; i++)
	{
		cin >> b[i];
	}

	if (b[0] == n)
	{
		cout << 0 << endl;
		return 0;
	}

	int a = b[0], k = 1;
	for (int i = b[0]+1; i <= n; i++)
	{
		if (k < s && i == b[k])
		{
			Op op;
			op.o = 1;
			op.a = a;
			op.b = i;
			d.push_back(op);
			a = n+ d.size();
			k++;
		}
		else
		{

			Op op1;
			op1.o = 3;
			op1.a = i;
			d.push_back(op1);
			Op op;
			op.o = 2;
			op.a = a;
			op.b = n+d.size();
			d.push_back(op);
			a = n+d.size();
		}
	}

	cout << d.size() << endl;
	for (int i = 0; i < d.size(); i++)
	{
		if (d[i].o == 3)
		{
			cout << d[i].o << " " << d[i].a << endl;
		}
		else
		{
			cout << d[i].o << " " << d[i].a << " " << d[i].b << endl;
		}
	}

	return 0;
}