#include <bits/stdc++.h>
using namespace std;

typedef long long ll; typedef unsigned long long ull;
const int inf = 1e9; const ll llnf = 4e18;

template< class Tp > void chkmax( Tp &x , Tp y ) { x = max( x , y ); }
template< class Tp > void chkmin( Tp &x , Tp y ) { x = min( x , y ); }

void solve( ) {
	int n; cin >> n;
	vector< tuple< int , int , int > > eG;

	auto adde = [&] ( int u , int v , int w ) -> void { assert( 0 <= u && u <= w && w <= v && v <= n ); eG.emplace_back( u , v , w ); } ;
	auto solve = [&] ( auto solve , int L , int R ) -> void {
		int t = R - L; if( t <= 3 ) return;
		int s = sqrt( t );
		for( int k = 0; ( s + 1 ) * k <= t; k ++ ) for( int i = s - 1; i >= 0; i -- ) if( ( s + 1 ) * k + s + 1 <= t ) adde( L + ( s + 1 ) * k + i , L + ( s + 1 ) * k + s + 1 , L + ( s + 1 ) * k + i + 1 );
		for( int k = 0; ( s + 1 ) * k <= t; k ++ ) for( int i = 2; i <= s; i ++ ) if( ( s + 1 ) * k + i <= t ) adde( L + ( s + 1 ) * k , L + ( s + 1 ) * k + i , L + ( s + 1 ) * k + i - 1 );
		for( int k = 0; ( s + 1 ) * k <= t; k ++ ) for( int l = k + 2; ( s + 1 ) * l <= t; l ++ ) if( ( s + 1 ) * l <= t ) adde( L + ( s + 1 ) * k , L + ( s + 1 ) * l , L + ( s + 1 ) * ( l - 1 ) );
		for( int k = 0; ( s + 1 ) * k <= t; k ++ ) if( ( s + 1 ) * k + 1 <= t ) solve( solve , L + ( s + 1 ) * k + 1 , L + min( t , ( s + 1 ) * k + s ) );
	} ;
	solve( solve , 0 , n );

	cout << ( int ) eG.size( ) << "\n"; for( auto [ u , v , w ] : eG ) cout << u << " " << w << " " << v << "\n"; cout.flush( );

	int q; cin >> q;
	while( q -- ) {
		int u , v; cin >> u >> v;
		if( v - u <= 3 ) { for( int i = u; i <= v; i ++ ) cout << i << " \n"[i == v]; cout.flush( ); continue; }
		vector< int > ans;
		auto dfs = [&] ( auto dfs , int L , int R ) -> void {
			int t = R - L; if( t <= 3 ) return;
			int s = sqrt( t );
			if( ( u - L ) / ( s + 1 ) == ( v - L ) / ( s + 1 ) ) {
				int k = ( u - L ) / ( s + 1 );
				if( ( u - L ) % ( s + 1 ) != 0 ) dfs( dfs , L + ( s + 1 ) * k + 1 , L + min( t , ( s + 1 ) * k + s ) );
				else ans = vector< int >{ u , v };
			}
			else {
				int k = ( u - L ) / ( s + 1 ) , l = ( v - L ) / ( s + 1 );
				ans = vector< int >{ u , L + ( s + 1 ) * k + s + 1 , L + ( s + 1 ) * l , v };
			}
		} ;
		dfs( dfs , 0 , n ); ans.erase( unique( ans.begin( ) , ans.end( ) ) , ans.end( ) );
		for( int i : ans ) cout << i << " \n"[i == ans.back( )]; cout.flush( );
	}
}

int main( ) {
	ios::sync_with_stdio( 0 ), cin.tie( 0 ), cout.tie( 0 );
	int T = 1; while( T -- ) solve( ); return 0;
}