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
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (auto i=(a); i<(b); i++)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif

const int maxN = 1 << 16;

bool target[maxN], curr[maxN];

enum class OPERATION
{
	Sum = 1,
	Join,
	Neg
};

void solve()
{
	int n, m;
	std::cin >> n >> m;

	while (m--)
	{
		int i;
		std::cin >> i;
		target[i] = true;
	}

	std::vector <std::tuple <OPERATION, int, int> > ops { { OPERATION::Neg, 1, 1 } };
	int lastSet = n+1;

	FOR(i, 1, n+1) if (curr[i] != target[i])
	{
		if (target[i])
			ops.push_back({ OPERATION::Sum, i, lastSet++});
		else
		{
			ops.push_back({ OPERATION::Neg, i, i });
			ops.push_back({ OPERATION::Join, lastSet++, lastSet++ });
		}

		for (int j=i; j<=n; j+=i)
			curr[j] = target[i];
	}

	std::cout << SZ(ops) << "\n";
	for (const auto& [op, a, b] : ops)
	{
		std::cout << static_cast<int>(op) << " " << a;

		if (op != OPERATION::Neg)
			std::cout << " " << b;
		std::cout << "\n";
	}
}

int main()
{
	std::ios_base::sync_with_stdio(false);

	int t = 1;
//	scanf ("%d", &t);	
	FOR(tid, 1, t+1)
	{
		//printf("Case #%d: ", tid);
		solve();
	}
	return 0;
}