#include<bits/stdc++.h>
using namespace std;
int n;
#define ll long long
struct no{
    ll x,y;
    no(){x=0,y=0;}
    no(ll x_,ll y_){x=x_,y=y_;}
};
no operator - (const no &a,const no &b){return no(a.x-b.x,a.y-b.y);}
no operator + (const no &a,const no &b){return no(a.x+b.x,a.y+b.y);}
ll cro(no a,no b){return a.x*b.y-a.y*b.x;}
ll dot(no a,no b){return a.x*b.x+a.y*b.y;}
#define pb push_back
const int N=4e5+10;
struct qq{
    int t;vector<no>A;
    inline ll ask(no z){
        if(A.empty())return 0;
        while(t+1<A.size()&&dot(z,A[t])<=dot(z,A[t+1]))t++;
        return dot(z,A[t]);
    }
}F[N<<2],G[N<<2];
no sta[N];int top;
qq bui(vector<no>e){
    top=0;for(no o:e){
        if(top&&sta[top].x==o.x){if(sta[top].y>=o.y)continue;top--;}
        while(top>1&&cro(sta[top]-sta[top-1],o-sta[top-1])>=0)top--;
        sta[++top]=o;
    }
    e.clear();
    for(int i=1;i<=top;i++)e.pb(sta[i]);
    qq p;p.A=e;p.t=0;return p;
}
qq operator + (const qq &x,const qq &y){
    if(x.A.empty())return y;if(y.A.empty())return x;
    vector<no>z;int i=0,j=0,ai=x.A.size(),bi=y.A.size();
    while(i<ai||j<bi){
        if(i<ai&&(j==bi||x.A[i].x<y.A[j].x))z.pb(x.A[i++]);
        else z.pb(y.A[j++]);
    }
    return bui(z);
}
qq operator * (const qq &x,const qq &y){
    if(x.A.empty())return y;if(y.A.empty())return x;
    qq z;int ai=x.A.size(),bi=y.A.size(),i=0,j=0;z.t=0;
    z.A.pb(x.A[0]+y.A[0]);
    while(i+1<ai||j+1<bi){
        if(i+1<ai&&(j+1==bi||cro(x.A[i+1]-x.A[i],y.A[j+1]-y.A[j])<=0))i++;
        else j++;
        z.A.pb(x.A[i]+y.A[j]);
    }
    return z;
}
void build(int p,int l,int r){
    if(l==r){
        int sz=1;
        if(!(l&1))scanf("%d",&sz);
        vector<no>a;
        ll x,y;
        while(sz--)scanf("%lld%lld",&x,&y),a.pb(no(x,y));
        sort(a.begin(),a.end(),[&](no a,no b){return a.x<b.x;});
        qq Z=bui(a);
        if(l&1)F[p]=Z;else G[p]=Z;
        return;
    }
    int mid=(l+r)>>1;
    build(p<<1,l,mid),build(p<<1|1,mid+1,r);
    G[p]=G[p<<1]*G[p<<1|1];
    F[p]=(F[p<<1]*G[p<<1|1])+F[p<<1|1];
}
ll ans[N];
struct que{
    int id;
    no a;int R;ll lim;
}o[N];
no fz;ll lk;int po;
void ask(int p,int l,int r,int x){
    if(po!=-1)return;
    if(x==r){
        if(F[p].ask(fz)<lk){lk-=G[p].ask(fz);return;}
        if(l==r){po=(l+1)/2;return;}
        int mid=(l+r)>>1;
        ask(p<<1|1,mid+1,r,r),ask(p<<1,l,mid,mid);
    }
    int mid=(l+r)>>1;
    if(x<=mid)ask(p<<1,l,mid,x);
    else ask(p<<1|1,mid+1,r,x),ask(p<<1,l,mid,x);
}
int main(){
    scanf("%d",&n);build(1,1,n*2-1);
    int q;scanf("%d",&q);ll x,y;
    for(int i=1;i<=q;i++)scanf("%d%lld%lld%lld",&o[i].R,&x,&y,&o[i].lim),o[i].a=no(x,y),o[i].id=i;
    sort(o+1,o+q+1,[&](que x,que y){return cro(x.a,y.a)<0;});
    for(int i=1;i<=q;i++){
        fz=o[i].a,lk=o[i].lim,po=-1;ask(1,1,n*2-1,o[i].R*2-1);
        ans[o[i].id]=po;
    }
    for(int i=1;i<=q;i++)printf("%lld\n",ans[i]);
    return 0;
}