#include <bits/stdc++.h>

int32_t main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n, T;
    std::cin >> n >> T;
    std::vector<std::vector<std::pair<int, int>>> fuck(n - 1);
    for (int i = 0; i < n - 1; i++) {
        int k;
        std::cin >> k;
        fuck[i].resize(k);
        for (auto& [u, v] : fuck[i]) {
            std::cin >> u >> v;
        }
        std::sort(fuck[i].begin(), fuck[i].end());
    }

    int q;
    std::cin >> q;
    std::vector<std::array<int, 3>> quer(q);
    for (int i = 0; i < q; i++) {
        auto& [l, r, id] = quer[i];
        std::cin >> l >> r;
        l--;
        r--;
        id = i;
    }

    std::vector<int64_t> ans(q, -1);
    for (int i = 0; i < q; i++) {
        auto [l, r, id] = quer[i];

        int64_t min = 1e18;
        for (int j = 0; j < fuck[l].size(); j++) {
            int d = 0, t = fuck[l][j].second;
            for (int p = l + 1; p < r; p++) {
                int mn = T;
                for (int j2 = 0; j2 < fuck[p].size(); j2++) {
                    auto [a, b] = fuck[p][j2];
                    assert(b != T);
                    if (t <= a && b < mn) {
                        mn = b;
                    }
                }
                if (mn == T) {
                    d++;
                    t = 0;
                    p--;
                    continue;
                } else {
                    t = mn;
                }
            }
            min = std::min(min, d * int64_t(T) + t - fuck[l][j].first);
        }
        ans[id] = min;
    }

    for (int i = 0; i < q; i++) {
        std::cout << ans[i] << " \n"[i == q - 1];
    }

    return 0;
}