#include <bits/stdc++.h>
#ifdef SHARAELONG
#include "../../cpp-header/debug.hpp"
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int MAX_N = (1 << 16) + 1;

vector<int> adj[MAX_N];
vector<tuple<int, int, int>> edges;

void add_edge(int l, int r) {
    if (r-l <= 3) return;
    int B = sqrt(r-l)+1;
    vector<int> blocks;
    for (int i=l, j; i<r; i=j) {
        j = min(r, i+B);
        if (i > l) for (int k=i+2; k<j; ++k) edges.push_back({ i, k-1, k });
        if (j < r) for (int k=j-2; k>i; --k) edges.push_back({ k, k+1, j });
        if (i > l) {
            if (i < j-1) edges.push_back({ i, j-1, j });
        } else {
            if (i+1 < j) edges.push_back({ i, i+1, j });
        }
        blocks.push_back(i);
        if (i > l && j < r) add_edge(i+1, j-1);
        else if (i > l) add_edge(i+1, j);
        else add_edge(i, j-1);
    }
    blocks.push_back(r);
    
    for (int i=0; i<blocks.size(); ++i) {
        for (int j=0; j+1<i; ++j) {
            edges.push_back({ blocks[j], blocks[i-1], blocks[i] });
        }
    }
}

void solve() {
    int n;
    cin >> n;
    for (int i=0; i<n; ++i) adj[i].push_back(i+1);
    
    add_edge(0, n);
    cout << edges.size() << '\n';
    for (auto[a, b, c]: edges) {
        cout << a << ' ' << b << ' ' << c << '\n';
        adj[a].push_back(c);
    }
    cout.flush();

    for (int i=0; i<=n; ++i) sort(adj[i].begin(), adj[i].end());
    
    int q;
    cin >> q;
    for (int i=0; i<q; ++i) {
        int l, r;
        cin >> l >> r;
        while (l < r) {
            cout << l << ' ';
            int idx = lower_bound(adj[l].begin(), adj[l].end(), r+1) - adj[l].begin() - 1;
            l = adj[l][idx];
        }
        cout << r << '\n';
        cout.flush();
    }
}

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

    solve();
}