// Skyqwq
#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 pair<int, int> PII;

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

void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}

template <typename T> void inline read(T &x) {
    int f = 1;
    x = 0;
    char s = getchar();

    while (s < '0' || s > '9') {
        if (s == '-')
            f = -1;

        s = getchar();
    }

    while (s <= '9' && s >= '0')
        x = x * 10 + (s ^ 48), s = getchar();

    x *= f;
}

const int N = 65540, S = 4;

int n, k, m, f[4][N];
vector<tuple<int,int,int>> ans;
map<pair<int,int>,int> vis;
void inline add(int i, int k, int j) {
    if (i + 1 >= j) return ;

	// printf("%d %d %d\n",i,k,j);
	// fflush(stdout);
	assert(vis[make_pair(i,k)]==1);
	assert(vis[make_pair(k,j)]==1);
	vis[{i,j}]=1;
	ans.emplace_back(i,k,j);
}

struct W {
    int m, u, v, P, Q, Z;
} G[S][N];

void inline work() {
    memset(f, 0x3f, sizeof f);

    for (int i = 0; i <= k; i++)
        f[i][0] = f[i][1] = 0;

    for (int i = 1; i <= n; i++)
        f[1][i] = 1ll * (i - 1) * (i - 2) / 2;

    for (int i = 2; i <= n; i++) {
        if (i <= 3) {
            f[2][i] = 0;
            continue;
        }

        int A = (i - 1) / 2;
        f[2][i] = f[2][A] + f[2][i - A - 1] + i - 3;
    }

    for (int j = 3; j <= k; j++) {
        for (int i = 1; i <= n; i++) {
            if (i <= j + 1) {
                f[j][i] = 0;
                continue;
            }

            f[j][i] = f[j - 1][i];
            int le = 3, re = i;
            //          if (j <= 3) re = min(re, 35);
            //          else if (j <= 5) re = min(re, 400);
            //          else le = max(3, i / 2 - 30), re = min(i, i / 2 + 30);
            int B = 2e3;

            //          if (j <= 3) B = 200;
            //          else if (j <= 4) B = 60;
            //          else if (j <= 5) B = 50;
            if (i >= 100) {
                int ot = 200;

                chkMin(re, G[j][i - 1].m + ot);
                chkMax(le, G[j][i - 1].m - ot);
            }

            for (int m = le; m <= re; m++) {
                int L = max((i - (m - 1)) / m, 0), R = min((i - (m - 1)) / 2, L + B);
                int lim = j <= 5 ? 5 : 1;
                chkMax(L, G[j][i - 1].u - lim);
                chkMin(R, G[j][i - 1].u + lim);

                for (int u = L; u <= R; u++) {
                    for (int v = u; v <= u + 1; v++) {
                        int le = (i - (m - 1) - u - v);

                        if (le < 0)
                            continue;

                        int c = f[j][u] + f[j][v] + max(u - 1, 0) + max(v - 1, 0);
                        c += f[j - 2][m - 1] + m - 2;

                        int P = le / (m - 2), Q = le % (m - 2);
                        int Z = m - 2 - Q;
                        c += f[j][P] * Z + Z * (max(2 * P - 2, 0));
                        c += f[j][P + 1] * Q + Q * (2 * P);

                        if (chkMin(f[j][i], c))
                            G[j][i] = (W) {
                            m, u, v, P, Q, Z
                        };
                    }

                }
            }
        }
    }

    //  cout<< f[k][n] << endl;
    //  for (int i = 1; i <= k; i++)cout << G[i][n].u << " awa" <<G[i][n].m << " awa\n";
}

vector<int> ed[N];

void inline link(int k, vector<int> a) {
	// print(a);
    int n = a.size();

    if (n <= k + 1)
        return;

    if (k == 1) {
        for (int i = 0; i < n; i++)
            for (int j = i + 2; j < n; j++)
                add(a[i], a[j-1], a[j]);

        return;
    }

    W o = G[k][n];
    int m = o.m, u = o.u, v = o.v, P = o.P, Q = o.Q;
    // printf("%d %d %d %d %d %d\n",n,m,u,v,P,a[u]);
    vector<int> key, le, re;
	
    for(int i=u-1;i>=0;i--)
    {
    	add(a[i], a[i+1], a[u]), le.pb(a[i]);
    }
	reverse(le.begin(),le.end());
    link(k, le);

    for (int i = n - v; i < n; i++)
        add(a[n - v - 1], a[i-1], a[i]), re.pb(a[i]);

    link(k, re);
    key.pb(a[u]);
    int num = u;

    for (int i = 1; i <= m - 2; i++) {
        int la = num;
        num += P + 1;

        if (i <= Q)
            num++;

        vector<int> now;
        int X = la, Y = num;

        for (int j = X + 1; j < Y; j++)
            now.pb(a[j]);
        
        for(int j=X+1;j<Y;j++)
        	 add(a[X], a[j-1], a[j]);
    	
    	for(int j=Y-1;j>X;j--)
    		add(a[j], a[j+1], a[Y]);

        link(k, now);
        key.pb(a[num]);
    }

    for (int i = 0; i + 1 < (int)key.size(); i++)
        add(key[i], key[i]+1, key[i + 1]);

    link(k - 2, key);
}

void qry(int l,int r,int L,int R)
{
	if(R-L<=3)
	{
		for(int i=L;i<=R;i++) printf("%d%c",i," \n"[i==R]);
		fflush(stdout);
		return ;
	}
	// printf("* %d %d %d %d\n",l,r,L,R);
	int n=r-l+1;
	W o = G[k][n];
    int m = o.m, u = o.u, v = o.v, P = o.P, Q = o.Q;
    vector<int> key;
    key.pb(l-1);
    key.pb(l+u);
    int num = u;

    for (int i = 1; i <= m - 2; i++) {
        num += P + 1;

        if (i <= Q)
            num++;

        key.pb(l+num);
    }
    key.pb(r+1);
    int idl=key.size(),idr=0;
    for(int i=(int)key.size()-1;i>=0;i--)
    {
    	if(R>=key[i])
    	{
    		idr=i;
    		break;
    	}
    }
    for(int i=0;i<(int)key.size();i++)
    {
    	if(L<=key[i])
    	{
    		idl=i;
    		break;
    	}
    }
    if(idl>idr)
    {
    	qry(key[idr]+1,key[idl]-1,L,R);
    }
    else
    {
		vector<int> ve={L,key[idl],key[idr],R};
		sort(ve.begin(),ve.end());
		ve.erase(unique(ve.begin(),ve.end()),ve.end());
		print(ve);
		fflush(stdout);
		for(int i=0;i+1<(int)ve.size();i++) assert(vis[make_pair(ve[i],ve[i+1])]==1);
	}
}

int main() {
    read(n); k=3;
    ++n;
    for(int i=0;i<n;i++) vis[make_pair(i,i+1)]=1;
    work();
    vector<int> t;

    for (int i = 0; i < n; i++)
        t.pb(i);

    link(k, t);
	
	cout<<ans.size()<<endl;
	for(auto [a,b,c]:ans) printf("%d %d %d\n",a,b,c);
	fflush(stdout);
	
	int Q; cin>>Q;
	while(Q--)
	{
		int l,r; read(l),read(r);
		qry(0,n-1,l,r);
	}
	
    return 0;
}