#include<bits/stdc++.h>
using namespace std;
int n,q,l,r;
map<long long,bool>imam;
vector<int>sola,solb,solc,G[70000];
void kill(int code){
  exit(code);
  cout<<code<<endl;
  while(true);
}
void spoji(int a,int b,int c){
  if(a==b or b==c or a==c)kill(1);
  if(a>=b or b>=c or a>=c)kill(2);
  if(a>n or b>n or c>n)kill(3);
  //if(!imam[b*100000+c])kill(4);
  if(!imam[a*100000+c]){
    //if(!imam[b*10000000+c])exit(3);
    imam[a*100000+c]=true;
    sola.push_back(a);
    solb.push_back(b);
    solc.push_back(c);
    G[a].push_back(c);
  }
}
void solve(){
  for(int OF=4; OF<=256; OF=OF*OF){
    for(int I=0; I<=n; I+=OF){
      int L=I;
      int R=min(I+OF,n);
      for(int i=L+2; i<=R; i++)spoji(L,i-1,i);
      for(int i=R-2; i>=L+1; i--)spoji(i,i+1,R);
    }
    for(int I=0; I<=n; I+=OF*OF){
      int L=I;
      int R=min(I+OF*OF,n);
      for(int i=L; i<=R; i+=OF)
        for(int j=i+OF*2; j<=R; j+=OF)
          spoji(i,j-OF,j);
    }
  }
}
int main(){
  //freopen("file.txt","r",stdin);
  cin>>n;
  for(int i=0; i<n; i++)imam[i*100000+i+1]=true;
  for(int i=0; i<n; i++)G[i].push_back(i+1);
  solve();
  //return 0;
  cout<<sola.size()<<"\n";
  for(int i=0; i<sola.size(); i++)
    cout<<sola[i]<<" "<<solb[i]<<" "<<solc[i]<<"\n";
  cin>>q;
  while(q--){
    cin>>l>>r;
    cout<<l<<" ";
    while(l!=r){
      int maxl=-1;
      for(int i=0; i<G[l].size(); i++)if(G[l][i]<=r)maxl=max(G[l][i],maxl);
      if(maxl==-1)exit(2);
      cout<<maxl<<" ";
      l=maxl;
    }
    cout<<endl;
  }
  cout<<flush;
  return 0;
}