// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define int long long
#define ull unsigned long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

int mod=1000000007;
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,B;

int anc[maxn][20],tot;
vi buc[maxn];
map<int,int>mp[maxn];

vector<array<int,3>>out;
void add(int u,int mid,int v){
	assert(mp[u][mid]);
	assert(mp[mid][v]);
	if(!mp[u][v]) mp[u][v]=1,out.pb({u,mid,v});
}

void div(vi p,int D)
{
	int n=p.size();
	assert(D<=18);
	assert(tot<=200000);
	if(n<=4)return;
	int id=++tot;
	for(int x:p) anc[x][D]=id;
	int B=sqrt(n-1);
	int l=0,r=0;
	
	vi pos;
	for(r=B-1;r<n-1;l=r,r+=B){
//		if(p.size()==101)cout<<"add "<<l<<" "<<r<<"\n";
		pos.pb(p[r]);
		Rep(i,r-2,l) add(p[i],p[i+1],p[r]);
		For(i,l+2,r) add(p[l],p[i-1],p[i]);
		vi tmp;
		For(i,l+1,r-1) tmp.pb(p[i]);
		div(tmp,D+1);
	}
	
	if(l<n-1){
		r=n-1;
//		if(p.size()==101)cout<<"add "<<l<<" "<<r<<"\n";
		Rep(i,r-2,l) add(p[i],p[i+1],p[r]);
		For(i,l+2,r) add(p[l],p[i-1],p[i]);
		vi tmp;
		For(i,l+1,r-1) tmp.pb(p[i]);
		div(tmp,D+1);
	}
	
	int sz=pos.size();
	For(i,0,sz-1)
		For(j,i+2,sz-1)
			add(pos[i],pos[j-1],pos[j]);
	
	buc[id]=pos;
}

signed main()
{
//	freopen("data.in","r",stdin);
//	freopen("my.out","w",stdout);
	cin>>n;
	tot=0;
	memset(anc,-1,sizeof anc);
	vi o;
	For(i,0,n-1)mp[i][i+1]=1;
	For(i,0,n)o.pb(i);
	div(o,0);
//	cout<<tot<<"\n";
	assert(out.size()<=n*6);
	cout<<out.size()<<endl;
	for(auto [u,mid,v]:out)cout<<u<<" "<<mid<<" "<<v<<endl;
	int Q;cin>>Q;
	while(Q--){
		int u,v;cin>>u>>v;
		if(v-u<=3){
			For(i,u,v)cout<<i<<" ";
			cout<<endl;
			continue;
		}
		if(mp[u][v]){
			cout<<u<<" "<<v<<endl;
			continue;
		}
		int d=0;
		while(anc[u][d+1]!=-1 && anc[v][d+1]!=-1 && anc[u][d+1]==anc[v][d+1]) 
			++d;
		
	//	cout<<"lca "<<d<<" "<<anc[u][d]<<" "<<anc[v][d]<<'\n';
		int lca=anc[u][d];
		auto&pos=buc[lca];
//		for(auto it:pos)cout<<it<<" ";cout<<"\n";
		vi ans; ans.pb(u);
		auto it=lower_bound(pos.begin(),pos.end(),u);
		if(u!=(*it)) ans.pb(*it);
//		cout<<"*it "<<*it<<"\n";
		auto it2=upper_bound(pos.begin(),pos.end(),v); --it2;
//		cout<<"*it2 "<<*it2<<"\n";
		if((*it)!=(*it2)) ans.pb(*it2);
		if((*it2)!=v) ans.pb(v);
		for(int x:ans)cout<<x<<" ";
		cout<<endl;
		
//		int siz=ans.size();
//		For(i,0,siz-2) if(mp[ans[i]][ans[i+1]]); else{
//			cerr<<"Fail "<<u<<" "<<v<<"\n";
//			exit(0);
//		}
	}
	return 0;
}
/*
100
1 0 4
*/