// Please submit with C++14!
#pragma region HEAD   // Spectre
#include <algorithm>  // By rbtree (https://rbtree.archi)
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <utility>
#include <vector>
#ifdef ___RB_DEBUG___
#include "rb_debug.h"
#else
#define dbg(...)
#endif
#define ra (scanf("%lld", &__TEMP_READ_VALUE), __TEMP_READ_VALUE)
#define LIKELY(exp) __builtin_expect(bool(exp), 1)
#define UNLIKELY(exp) __builtin_expect(bool(exp), 0)

typedef long long tp;
tp __TEMP_READ_VALUE;
using namespace std;
#pragma endregion HEAD

////////////////////////////////////////////////////////////////////////////////

signed main() {
  tp n = ra, maxk = ra, tar = -1;
  array<bool, 3003> a;
  for (auto _ : {1, 2, 3}) {
    for (tp i = 1; i <= n; ++i) {
      printf("1 1 %lld\n", i);
    }
  }
  puts("2");
  fflush(stdout);
  for (tp i = 1; i <= 3 * n; ++i) {
    a[i] = ra;
  }
  for (tp i = 1; i <= n; ++i) {
    if (a[i] + a[i + n] + a[i + n + n] <= 1) {
      printf("%lld\n", i);
    }
  }
  return 0;
}

////////////////////////////////////////////////////////////////////////////////