//https://qoj.ac/contest/1356/problem/7182
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define PI acos(-1)
#define LSB(i) ((i) & -(i))
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define sc second
#define th third
#define fo fourth
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
#define INF 1e15
#define MOD 1000000007
#define endl "\n"

#define all(data)       data.begin(),data.end()
#define TYPEMAX(type)   std::numeric_limits<type>::max()
#define TYPEMIN(type)   std::numeric_limits<type>::min()
#define MAXN 100007
vector<ll> adj[MAXN];
vector<pair<pll,ll>> edge;
ll n,q;
map<pll,ll> mm;
void Precalc(ll l,ll r)
{
    if(!(l==0 && r==n))
    {
        for(int i=l+2;i<=r;i++)
        {
            if(!mm.count({l,i})) {mm[{l,i}]=1; edge.pb({{l,i},i-1}); adj[l].pb(i);}
        }
        for(int i=r-2;i>=l;i--)
        {
            if(!mm.count({i,r})) {mm[{i,r}]=1; edge.pb({{i,r},i+1}); adj[i].pb(r);}
        }
    }
    if(r-l<4) return;
    vector<ll> v;
    ll l2=l,sz=sqrt(r-l+1);
    while(l2<=r) {v.pb(l2); l2+=sz;}
    if(v.back()!=r) v.pb(r);
    for(int i=1;i<v.size();i++) Precalc(v[i-1],v[i]);
    for(int i=1;i<v.size();i++)
    {
        for(ll j=i+2;j<v.size();j++)
        {
            ll a=v[i],c=v[j];
            if(!mm.count({a,c}))
            {
                ll b=v[j-1];
                mm[{a,c}]=1;
                edge.pb({{a,c},b});
                adj[a].pb(c);
            }
        }
    }
    v.clear();
}
int main()
{
    //ios::sync_with_stdio(false); cin.tie(0);
    cin>>n;
    for(int i=0;i<n;i++) adj[i].pb(i+1);
    for(int i=0;i<n;i++) mm[{i,i+1}]=1;
    Precalc(0,n);
    for(int i=0;i<=n;i++) sort(all(adj[i]));
    cout<<edge.size()<<endl;
    for(auto x:edge) cout<<x.fi.fi<<" "<<x.sc<<" "<<x.fi.sc<<endl;
    cin>>q;
    for(int i=1;i<=q;i++)
    {
        ll u,v; cin>>u>>v;
        ll w=u; cout<<u<<" ";
        while(true)
        {
            if(w==v) break;
            ll ww=w;
            for(int t=0;t<adj[w].size();t++)
            {
                if(adj[w][t]<=v) ww=adj[w][t];
                else break;
            }
            w=ww; cout<<ww<<" ";
        }
        cout<<endl;
    }
    return 0;
}