#include <bits/stdc++.h>

using namespace std;

#define MAXN 65550

long long n;
long long q;
vector<long long> adj[MAXN];
vector<pair<pair<long long,long long>,long long>> query;
map<pair<long long,long long>,bool> mapa;

void blokovi(long long l,long long r)
{
    if (!(l==0 and r==n))
    {
        for (long long i=l+2;i<=r;i++)
        {
            if (mapa.find({l,i})==mapa.end())
            {
                mapa[{l,i}]=true;
                query.push_back({{l,i},i-1});
                adj[l].push_back(i);
            }
        }
        for (long long i=r-2;i>=l;i--)
        {
            if (mapa.find({i,r})==mapa.end())
            {
                mapa[{i,r}]=true;
                query.push_back({{i,r},i+1});
                adj[i].push_back(r);
            }
        }
    }
    if (r-l<=3) return;
    vector<long long> koren;
    long long val=sqrt(r-l+1);
    long long node=l;
    bool da=false;
    while (node<=r)
    {
        if (node==r) da=true;
        koren.push_back(node);
        node+=val;
    }
    if (!da) koren.push_back(r);
    for (long long i=0;i<koren.size()-1;i++)
    {
        long long node1=koren[i];
        long long node2=koren[i+1];
        blokovi(node1,node2);
    }
    for (long long i=1;i<koren.size();i++)
    {
        for (long long j=i+2;j<koren.size();j++)
        {
            long long node1=koren[i];
            long long node2=koren[j];
            if (mapa.find({node1,node2})==mapa.end())
            {
                long long node3=koren[j-1];
                mapa[{node1,node2}]=true;
                query.push_back({{node1,node2},node3});
                adj[node1].push_back(node2);
            }
        }
    }
    koren.clear();
}

int main()
{
    cin>>n;
    for (long long i=0;i<n;i++) adj[i].push_back(i+1);
    for (long long i=0;i<n;i++) mapa[{i,i+1}]=true;
    blokovi(0,n);
    cout<<query.size()<<endl;
    for (long long i=0;i<query.size();i++)
    {
        long long node1=query[i].first.first;
        long long node2=query[i].second;
        long long node3=query[i].first.second;
        cout<<node1<<" "<<node2<<" "<<node3<<endl;
    }
    for (long long i=0;i<=n;i++) sort(adj[i].begin(),adj[i].end());
    cin>>q;
    for (long long z=0;z<q;z++)
    {
        long long a,b;
        cin>>a>>b;
        cout<<a<<" ";
        long long poslednji=a;
        while (true)
        {
            if (poslednji==b) break;
            long long s=adj[poslednji].size();
            long long tren=poslednji;
            for (long long i=0;i<s;i++)
            {
                long long node=adj[poslednji][i];
                if (node<=b) tren=node;
                else break;
            }
            cout<<tren<<" ";
            poslednji=tren;
        }
        cout<<endl;
    }
}