#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
const int sqr = 300;
int n;
ll T;
vector<pll> segs[100001];
int level_ind[100001];
vi inds[100001];
pll nxt[100001];
vector<pll> graph[100001];
ll query_ans[300001];
vector<pii> queries[100001];
ll ans1[100001];
vl min_dists[100001];
ll root_dist[100001];
vector<pll> transform(vector<pll> segs)
{
sort(all(segs));
reverse(all(segs));
vector<pll> ans;
ll cur_min = 1e18;
forall(it,segs)
{
if(it.ss < cur_min)
{
ans.pb(it);
cur_min = it.ss;
}
}
reverse(all(ans));
return ans;
}
void dfs1(int v, ll d)
{
root_dist[v] = d;
ans1[level_ind[v]] = min(ans1[level_ind[v]],d);
forall(it,graph[v]) dfs1(it.ff,d+it.ss);
}
void solve1(int v)
{
rep2(i,1,n-1) ans1[i] = 1e18;
int cur = 0;
rep(i,siz(segs[v])) dfs1(inds[v][cur++],segs[v][i].ss-segs[v][i].ff);
forall(it,queries[v]) query_ans[it.ss] = ans1[it.ff];
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
cin >> n >> T;
rep2(i,1,n-1)
{
int m;
cin >> m;
rep(j,m)
{
ll a,b;
cin >> a >> b;
segs[i].pb({a,b});
}
}
int q;
cin >> q;
rep(qq,q)
{
int l,r;
cin >> l >> r;
queries[r-1].pb({l,qq});
}
rep2(i,1,n-1) segs[i] = transform(segs[i]);
int cur = siz(segs[n-1])+1;
rep2(i,1,cur-1)
{
graph[0].pb({i,0});
inds[n-1].pb(i);
level_ind[i] = n-1;
}
for(int i = n-2; i >= 1; i--)
{
int cur2 = cur-siz(segs[i+1]);
rep(j,siz(segs[i]))
{
int l = 0;
int r = siz(segs[i+1])-1;
int ans = 0;
while(l <= r)
{
int mid = (l+r)/2;
if(segs[i+1][mid].ff >= segs[i][j].ss)
{
ans = mid;
r = mid-1;
}
else
{
l = mid+1;
}
}
ll dist = (segs[i+1][ans].ff-segs[i][j].ss+T)%T+segs[i][j].ss-segs[i][j].ff;
nxt[cur] = {cur2+ans,dist};
graph[cur2+ans].pb({cur,dist});
level_ind[cur] = i;
inds[i].pb(cur);
cur++;
}
}
rep2(i,1,n-1) if(siz(segs[i]) >= sqr) solve1(i);
dfs1(0,0);
rep2(i,1,n-1)
{
forall(it,inds[i])
{
min_dists[it] = {root_dist[it]};
forall(it2,graph[it])
{
min_dists[it2.ff].pb(root_dist[it]);
if(siz(min_dists[it]) < siz(min_dists[it2.ff])) swap(min_dists[it],min_dists[it2.ff]);
rep(i,siz(min_dists[it2.ff]))
{
int ind2 = siz(min_dists[it])-siz(min_dists[it2.ff])+i;
min_dists[it][ind2] = min(min_dists[it][ind2],min_dists[it2.ff][i]);
}
}
}
if(siz(segs[i]) < sqr)
{
forall(it,queries[i])
{
ll ans = 1e18;
int cur = 0;
int p = i-it.ff;
forall(it2,inds[i])
{
if(siz(min_dists[it2])-1-p >= 0) ans = min(ans,segs[i][cur].ss-segs[i][cur].ff+min_dists[it2][siz(min_dists[it2])-1-p]-root_dist[it2]);
cur++;
}
query_ans[it.ss] = ans;
}
}
}
rep(qq,q) cout << query_ans[qq] << "\n";
}
