#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = (1 << 16) + 10;
int sq[N];
vector<tuple<int, int, int>> edges;

void precalc() {
    for (int i = 1; i * i <= N - 1; i++) {
        for (int j = 0; j <= 2 * i && i * i + j <= N - 1; j++) {
            sq[i * i + j] = i;
        }
    }
}

void add_edge(int a, int b, int c) {
    edges.emplace_back(a, b, c);
}

void build(int l, int r) {
    int len = r - l + 1;
    if (len <= 4) {
        return;
    } else {
        int b = sq[len];
        vector<int> vec = {l - 1};
        for (int i = l + b - 1; i <= r; i += b) {
            vec.push_back(i);
        }
        vec.push_back(r + 1);
        int k = vec.size() - 2;
        for (int ii = 1; ii <= k; ii++) {
            int x = vec[ii];
            int lef = vec[ii - 1];
            int rig = vec[ii + 1];
            for (int i = x + 2; i <= rig - 1; i++) {
                add_edge(x, i - 1, i);
            }
            for (int i = x - 2; i >= lef + 1; i--) {
                add_edge(i, i + 1, x);
            }
            if (rig <= r) {
                add_edge(x, rig - 1, rig);
            }
        }
        for (int i = 1; i <= k; i++) {
            for (int j = i + 2; j <= k; j++) {
                add_edge(vec[i], vec[j - 1], vec[j]);
            }
        }
        for (int i = 0; i <= k; i++) {
            build(vec[i] + 1, vec[i + 1] - 1);
        }
    }
}

void print_path(vector<int> path) {
    path.erase(unique(path.begin(), path.end()), path.end());
    for (int v : path) {
        cout << v << " ";
    }
    cout << "\n";
    fflush(stdout);
}

vector<int> get(int u, int v, int l, int r) {
    // cout << l << " " << r << endl;
    int len = r - l + 1;
    if (len <= 4) {
        vector<int> path;
        for (int i = u; i <= v; i++) {
            path.push_back(i);
        }
        return path;
    } else {
        int b = sq[len];
        u = u - l + 1;
        v = v - l + 1;
        int ru = (u + b - 1) / b * b;
        int rv = (v + b - 1) / b * b;
        int lu = ru - b;
        int lv = rv - b;
        if (ru == rv) {
            if (v == rv || u == lu) {
                return {u + l - 1, v + l - 1};
            } else {
                return get(u + l - 1, v + l - 1, lu + l, min(r, ru + l - 2));
            }
        } else {
            return {u + l - 1, ru + l - 1, lv + l - 1, v + l - 1};
        }
    }
}

bool check_edges(int n) {
    set<pair<int, int>> s;
    for (int i = 0; i <= n - 1; i++) {
        s.insert({i, i + 1});
    }
    for (auto [a, b, c] : edges) {
        if (!s.count({a, b}) || !s.count({b, c}) || s.count({a, c})) {
            return false;
        }
        s.insert({a, c});
    }
    return true;
}

void stress() {
    mt19937 rnd;
    while (true) {
        edges.clear();
        int n = rnd() % 1000;
        build(0, n);
        if (edges.size() > 6 * n) {
            cout << "WA\n";
            cout << n << " " << edges.size() << "\n";
            break;
        } else {
            if (!check_edges(n)) {
                cout << "WA\n";
                cout << n << "\n";
                break;
            } else {
                set<pair<int, int>> s;
                for (auto [a, b, c] : edges) {
                    s.insert({a, c});
                }
                for (int i = 0; i <= n - 1; i++) {
                    s.insert({i, i + 1});
                }
                int q = rnd() % 100 + 1;
                while (q--) {
                    int u = rnd() % (n + 1);
                    int v = rnd() % (n + 1);
                    if (u > v) swap(u, v);
                    auto path = get(u, v, 0, n);
                    path.erase(unique(path.begin(), path.end()), path.end());
                    bool ok = path.size() <= 4 && path.front() == u && path.back() == v;
                    for (int i = 0; i + 1 < path.size(); i++) {
                        ok &= s.count({path[i], path[i + 1]});
                    }
                    if (!ok) {
                        cout << "WA\n";
                        cout << n << "\n";
                        cout << u << " " << v << "\n";
                        for (int i : path) {
                            cout << i << " ";
                        }
                        cout << "\n";
                        exit(0);
                    }
                }
                cout << "OK\t" << n << "\t" << edges.size() << endl;
            }
        }
    }
    exit(0);
}

int main() {
//    ios_base::sync_with_stdio(false);
//    cin.tie(nullptr);
//#ifdef LOCAL
//    freopen("input.txt", "r", stdin);
//#endif

    precalc();

    // stress();

    int n;
    cin >> n;
    build(0, n);

    cout << edges.size() << "\n";
    for (auto [a, b, c] : edges) {
        cout << a << " " << b << " " << c << "\n";
    }
    fflush(stdout);

    int q;
    cin >> q;
    while (q--) {
        int u, v;
        cin >> u >> v;
        print_path(get(u, v, 0, n));
    }

#ifdef LOCAL
    cout << "\nTime elapsed: " << double(clock()) / CLOCKS_PER_SEC << " s.\n";
#endif
}