#include<cstdio>
#include<vector>
#include<queue>
#include<map> 
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<assert.h>
#include<cmath>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
	int s=1;
	while(y){
		if(y&1)s=1ll*s*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return s;
}
#define flh fflush(stdout)
const int N=(1<<16)+10; 
int n;
struct edge{
	int a,b,c;
	edge(int u=0,int v=0,int w=0){a=u,b=v,c=w;}
};
vector<edge>ans;
map<int,int>vis[N];
void adde(int x,int y,int z){
	if(vis[x][z])return ;
	vis[x][z]=1;
	ans.pb(edge(x,y,z));
}
void build(int l,int r){
	int len=r-l+1;
	int B=sqrt(len);
	if(l==r)return ;
	if(l+1==r){
		adde(l,r,r+1);
		return ;
	}
	vpii vec;
	for(int o=1;;o++){
		//[(o-1)*B,o*B-1]
		if(l+(o-1)*B>r)break;
		int L=l+(o-1)*B,R=min(r,l+o*B-1);
		build(L,R);
		for(int i=L+1;i<=R;i++)
			adde(L,i,i+1);
		for(int i=R-1;i>=L;i--)
			adde(i,i+1,R+1);
		vec.pb(mp(L,R));
	}
	int sz=vec.size();
	for(int i=0;i<sz;i++)
		for(int j=i+1;j<sz;j++)
			adde(vec[i].fi,vec[j].fi,vec[j].se+1);
}
void query(int l,int r,int ql,int qr){
	int len=r-l+1;
	int B=sqrt(len);
	int bl=0,br=0;
	for(int o=1;;o++){
		//[(o-1)*B,o*B-1]
		if(l+(o-1)*B>r)break;
		int L=l+(o-1)*B,R=min(r,l+o*B-1);
		if(ql>=L&&qr<=R){
			query(L,R,ql,qr);
			return ;
		}
		if(ql>=L&&ql<=R)bl=o;
		if(qr>=L&&qr<=R)br=o;
	}
	if(bl+1==br)
		if(l+(br-1)*B==qr+1)
			cout<<ql<<' '<<qr+1<<'\n';
		else
			cout<<ql<<' '<<l+(br-1)*B<<' '<<qr+1<<'\n';
	else{
		if(l+(br-1)*B==qr+1)
			cout<<ql<<' '<<l+bl*B<<' '<<qr+1<<'\n';
		else
			cout<<ql<<' '<<l+bl*B<<' '<<l+(br-1)*B<<' '<<qr+1<<'\n';
	}
}
signed main(){
	#ifdef do_while_true
		assert(freopen("data.in","r",stdin));
//		assert(freopen("data.out","w",stdout));
	#endif
	read(n);
	build(0,n-1);
	cout<<ans.size()<<'\n';
	for(auto i:ans)cout<<i.a<<' '<<i.b<<' '<<i.c<<'\n';
	flh;
	int q;read(q);
	while(q--){
		int l,r;read(l,r);
		if(l+1==r){
			cout<<l<<' '<<r<<'\n';
			flh;
			continue;
		}
		query(0,n-1,l,r-1);
		flh;
	}
    #ifdef do_while_true
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}