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
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

const int nax = 50001;

int main() {
  cin.tie(0)->sync_with_stdio(0);

  int n, m;
  cin >> n >> m;
  vector<int> u(n + 1), trg(n + 1);
  for(int i = 0; i < m; i++) {
    int x;
    cin >> x;
    trg[x] = 1;
  }
  u[n] = 1;

  vector<array<int, 3>> ans;
  for(int i = 1; i <= n; i++) {
    if(u[i] != trg[i]) {
      if(trg[i]) {
        ans.push_back({1, n + ans.size(), i});
        for(int j = i; j <= n; j += i) u[j] = 1;
      } else {
        ans.push_back({3, i, 0});
        ans.push_back({2, n + ans.size() - 1, n + ans.size()});
        for(int j = i; j <= n; j += i) u[j] = 0;
      }
    }
  }

  cout << ans.size() << endl;
  for(int i = 0; i < ans.size(); i++) {
    cout << ans[i][0] << " " << ans[i][1];
    if(ans[i][0] < 3) cout << " " << ans[i][2];
    cout << '\n';
  }
}