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
#include <iostream>
const int MAX_S = 50000;
int B[MAX_S];
int main()
{
	
	int n, s;
	std::cin >> n;
	std::cin >> s;
	for (int i = 0; i < s; i++) {
		std::cin >> B[i];
	}
	//generuje wszystkie negacje są na pozycja (n+i)
	for (int i = 0; i < n; i++) {
		std::cout << 3 << " " << (i + 1) << "\n";
	}
	// w zależności 
	int cur_b_pos = 0;
	if (B[0] == 1) {
		if (s == 1 || B[1] > 2) {
			std::cout << 2 << " " << 1 << " " << n + 2 << "\n";
			cur_b_pos = 1;
		}
		else {
			std::cout << 1 << " " << 1 << " " << 2 << "\n";
			cur_b_pos = 2;
		}
	}
	if (B[0] > 1) {
		if (B[0] == 2) {
			std::cout << 2 << " " << n + 1 << " " << 2 << "\n";
			cur_b_pos = 1;
		}
		else {
			std::cout << 2 << " " << n + 1 << " " << n + 2 << "\n";
		}
	}
	for (int i = 3; i <= n; i++) {
		//the element is not in the set
		//std::cout <<"[" << cur_b_pos << " " << B[cur_b_pos] << " " << i << "]";
		if (cur_b_pos == s || B[cur_b_pos] != i) {
			std::cout << 2 << " " << 2 * n + i - 2 << " " << (n + i) << "\n";
		}
		else {
			// the element is in the set
			std::cout << 1 << " " << 2 * n + i - 2 << " " << i << "\n";
			cur_b_pos++; 
		}
	}


}