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

int main()
{
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);

  int n;
  int s;

  std::cin >> n >> s;
  std::vector<bool> nalezyDoZbioru(n+1, false);
  for (int i = 0; i < s; ++i)
  {
    int x;
    std::cin >> x;
    nalezyDoZbioru[x] = true;
  }
  
  std::cout << (2 * n - s) << "\n";
  int ostatniZbior = n;
  for (int i = 1; i <= n; ++i)
  {
    if (nalezyDoZbioru[i])
    {
      std::cout << 1 << " " << i << " " << ostatniZbior << "\n";
      ostatniZbior++;
    }
    else
    {
      std::cout << 3 << " " << i  << "\n";
      std::cout << 2 << " " << ostatniZbior << " " << (ostatniZbior+1) << "\n";
      ostatniZbior++;
      ostatniZbior++;
    }
  }
}