#include<iostream>
#include<cstring>
#include<vector>
#include<set>
#include<array>
#include<cmath>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;
    // set<array<int, 3> > s;
    vector<array<int, 3> > s;
    set<array<int, 2> > s2;

    auto add = [&](int a, int b, int c){
        if (!s2.contains({a, c})){
            s.push_back({a, b, c});
            s2.insert({a, c});
        }
    };

    auto solve = [&](auto &&solve, int l, int r) -> void {
        if (r - l <= 1) return;
        const int S = sqrt(r - l);
        for(int i = l; i < r; i += S){
            int L = i, R = min(r, i + S);
            solve(solve, L, R);
        }
        for(int i = l; i < r; i += S){
            for(int j = i + S; j < r; j += S){
                add(i, j, min(r, j + S));
            }
        }        
        for(int i = l; i < r; i++){
            int L = i - (i - l) % S;
            if (i - L >= 2){
                add(L, i - 1, i);
            }
        }
        for(int i = r - 1; i >= l; i--){
            int L = i - (i - l) % S;
            int R = min(r, L + S);
            if (R - i >= 2){
                add(i, i + 1, R);
            }
        }
    };

    solve(solve, 0, n);
    cout << s.size() << '\n';
    for(auto [x, y, z] : s) cout << x << ' ' << y << ' ' << z << '\n';
    cout.flush();

    int q;
    cin >> q;
    while(q--){
        int x, y;
        cin >> x >> y;

        vector<int> ans{x};

        auto solve = [&](auto &&solve, int l, int r){
            if (r - l <= 1){
                ans.push_back(y);
                return;
            }
            const int S = sqrt(r - l);
            int L1 = x - (x - l) % S;
            int L2 = y - (y - l) % S;
            if (L1 == L2){
                int R = min(L1 + S, r);
                solve(solve, L1, R);
                return;
            }
            if (min(L1 + S, r) != ans.back()) ans.push_back(min(L1 + S, r));
            if (L2 != ans.back()) ans.push_back(L2);
            if (y != ans.back()) ans.push_back(y);
        };

        solve(solve, 0, n);

        for(int i = 0; i < ans.size(); i++)
            cout << ans[i] << " \n"[i + 1 == ans.size()];
        cout.flush();
    }

}