#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int MAX_N = 1 << 16;
constexpr Int INF = 1001001001001001001LL;

Int dp[MAX_N + 1], prv[MAX_N + 1];

int N;
int counterAe;
vector<pair<int, pair<int, int>>> edges;
set<pair<int, int>> added;
void ae(int a, int b, int c) {
// cerr<<"[ae] "<<a<<" "<<b<<" "<<c<<endl;
  ++counterAe;
  assert(!added.emplace(a, b).second);
  assert(!added.emplace(b, c).second);
  if (added.emplace(a, c).second) {
    edges.emplace_back(a, make_pair(b, c));
  }
}
void build(int l, int r) {
  const int n = r - l;
  if (n <= 1) {
    return;
  }
  const int k = prv[n];
  const int quo = (n - k) / (k + 1);
  const int rem = (n - k) % (k + 1);
  vector<int> cuts(k + 2);
  cuts[0] = l;
  cuts[1] = l + quo;
  for (int j = 1; j <= k; ++j) {
    cuts[j + 1] = cuts[j] + 1 + (quo + ((j <= rem) ? 1 : 0));
  }
// cerr<<l<<" "<<r<<" "<<k<<": "<<cuts<<endl;
  assert(cuts[k + 1] == r);
  for (int j = 0; j <= k; ++j) {
    build(cuts[j] + (j ? 1 : 0), cuts[j + 1]);
  }
  // intra
  for (int j = 1; j <= k; ++j) {
    for (int i = cuts[j] - 2; i >= cuts[j - 1]; --i) {
      ae(i, i + 1, cuts[j]);
    }
    for (int i = cuts[j] + 2; i < cuts[j + 1]; ++i) {
      ae(cuts[j], i - 1, i);
    }
  }
  if (cuts[k] < r - 1) {
    ae(cuts[k], r - 1, r);
  }
  // inter
  for (int j0 = 1; j0 <= k; ++j0) {
    for (int j1 = j0 + 2; j1 <= k; ++j1) {
      ae(cuts[j0], cuts[j1 - 1], cuts[j1]);
    }
  }
}
int ansLen;
int ans[10];
void go(int a, int b) {
  assert(ans[ansLen - 1] == a);
  if (a < b) {
#ifdef LOCAL
// cerr<<"[go] "<<a<<" "<<b<<endl;
assert(!added.emplace(a,b).second);
#endif
    ans[ansLen++] = b;
  }
}
void dfs(int l, int r, int a, int b) {
  assert(l <= a); assert(a < b); assert(b <= r);
  const int n = r - l;
  if (n == 1) {
    go(a, b);
    return;
  }
  const int k = prv[n];
  const int quo = (n - k) / (k + 1);
  const int rem = (n - k) % (k + 1);
  auto cuts = [&](int j) -> int {
    assert(0 <= j); assert(j <= k + 1);
    return l + j * quo + max(j - 1, 0) + min(max(j - 1, 0), rem);
  };
  assert(cuts(0) == l);
  assert(cuts(k + 1) == r);
  int jA, jB;
  {
    int lo = 0, hi = k + 1;
    for (; lo + 1 < hi; ) {
      const int mid = (lo + hi) / 2;
      ((a <= cuts(mid)) ? hi : lo) = mid;
    }
    jA = hi;
  }
  {
    int lo = 0, hi = k + 1;
    for (; lo + 1 < hi; ) {
      const int mid = (lo + hi) / 2;
      ((cuts(mid) < b) ? lo : hi) = mid;
    }
    jB = lo;
  }
// cerr<<l<<" "<<r<<" "<<a<<" "<<b<<": "<<jA<<" "<<jB<<"; cuts = ";for(int j=0;j<=k;++j)cerr<<cuts(j)<<" ";cerr<<endl;
  const int aa = cuts(jA);
  const int bb = cuts(jB);
  if (aa <= bb) {
    go(a, aa);
    go(aa, bb);
    go(bb, b);
  } else {
    assert((jA - 1) + 1 == (jB + 1));
    dfs(cuts(jA - 1) + ((jA - 1) ? 1 : 0), cuts(jB + 1), a, b);
  }
}
void query(int a, int b) {
// cerr<<COLOR("33")<<"[query] "<<a<<" "<<b<<COLOR()<<endl;
  ansLen = 0;
  ans[ansLen++] = a;
  dfs(0, N, a, b);
  assert(ans[ansLen - 1] == b);
  assert(ansLen <= 4);
  for (int h = 0; h < ansLen; ++h) {
    if (h) printf(" ");
    printf("%d", ans[h]);
  }
  puts("");
  fflush(stdout);
}

int main() {
  dp[1] = 0;
  for (Int n = 2; n <= MAX_N; ++n) {
    dp[n] = INF;
    // k marked points
    // for (Int k = 2; k <= n; ++k) {
    for (Int k = 1; k <= n && k < 300; ++k) {
      const Int q = (n - k) / (k + 1);
      const Int r = (n - k) % (k + 1);
      Int cost = 0;
      // inter
      cost += k * (k - 1) / 2;
      // intra
      cost += min(r, k - 1) * 2 * max((q + 1) - 1, 0LL);
      cost += ((k - 1) - min(r, k - 1)) * 2 * max(q - 1, 0LL);
      cost += max(q - 1, 0LL);
      cost += max(((r >= k) ? (q + 1) : q) - 0, 0LL);
      // rec
      cost += r * dp[q + 1];
      cost += (k + 1 - r) * dp[q];
      if (chmin(dp[n], cost)) {
        prv[n] = k;
      }
    }
if(n<=16||!(n&(n-1))||dp[n]>6*n)cerr<<n<<": "<<dp[n]<<" "<<dp[n]/(double)n<<" "<<prv[n]<<endl;
    assert(dp[n] <= 6 * n);
  }
cerr<<"max prv = "<<*max_element(prv,prv+(MAX_N+1))<<endl;
  
  scanf("%d", &N);
  for (int i = 0; i < N; ++i) {
    added.emplace(i, i + 1);
  }
  build(0, N);
  printf("%d\n", (int)edges.size());
  for (const auto &edge : edges) {
    printf("%d %d %d\n", edge.first, edge.second.first, edge.second.second);
  }
  fflush(stdout);
  assert(counterAe == dp[N]);
  
#ifdef LOCAL
for(int a=0;a<=N;++a)for(int b=a+1;b<=N;++b)query(a,b);
#endif
  int Q;
  scanf("%d", &Q);
  for (; Q--; ) {
    int a, b;
    scanf("%d%d", &a, &b);
    query(a, b);
  }
  return 0;
}