#include<bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;

template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}

int readint(){
	int x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

map<pii,bool> was;
vector<array<int,3>> ans;
vector<int> g[100005];

void solve(int l,int r){
	if(r-l<=1) return;
	int k=sqrt(r-l);
	vector<int> from,to;
	for(int i=l;i<r;i+=k) solve(i,min(r,i+k));
	for(int i=l;i<r;i+=k) for(int j=i+k;j<r;j+=k) if(!was[mp(i,min(j+k,r))])
		ans.pb({i,j,min(j+k,r)}),was[mp(i,min(j+k,r))]=true;
	for(int i=l;i<r;i++){
		int from=i-(i-l)%k;
		if(i-from>=2) if(!was[mp(from,i)]) ans.pb({from,i-1,i}),was[mp(from,i)]=true;
	}
	for(int i=r-1;i>=l;i--){
		int from=i-(i-l)%k,to=min(r,from+k);
		if(to-i>=2) if(!was[mp(i,to)]) ans.pb({i,i+1,to}),was[mp(i,to)]=true;
	}
}

int main(){
	int n=readint();
	for(int i=0;i<n;i++) was[mp(i,i+1)]=true,g[i].pb(i+1);
	solve(0,n);
	printf("%d\n",ans.size());
	for(int i=0;i<(int)ans.size();i++){
		printf("%d %d %d\n",ans[i][0],ans[i][1],ans[i][2]);
		g[ans[i][0]].pb(ans[i][2]);
	}
	fflush(stdout);
	int q=readint();
	while(q--){
		int l=readint(),r=readint();
		vector<int> res;
		while(l!=r){
			res.pb(l);
			int x=l;
			for(int i:g[l]) if(i<=r) x=max(x,i);
			l=x;
		}
		res.pb(r);
		for(int i:res) printf("%d ",i); printf("\n"); fflush(stdout);
	}
	return 0;
}