#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#include<fstream>
#include<stdio.h>
#define F 1000
#define N 1000
#define M 1000
#define endl '\n'
using namespace std;
typedef long long ll;
ll i,j,p,q,n,m,k,D,T,f,uk,tek,s[2*M+6];
bool fl;
bool bb[2*F+6];
struct Point
{
    ll x,y;
}t[2*N+6];
struct Bus
{
    ll l,r,nom;
}b[2*M+6];
struct Turist
{
    ll a,b,c;
}a[2*F+6];
vector <ll> v[2*M+6],br[2*M+6];
ll raz(Point a,Point b)
{
    return (abs(a.x-b.x)+abs(a.y-b.y));
}
bool fff(Bus a,Bus b)
{
    if(a.l!=b.l)
        return (a.l<b.l);
    if(a.r!=b.r)
        return (a.r<b.r);
    return (a.nom<b.nom);
}
void dfs(ll u,ll d)
{
    if(d>=b[uk].l)return ;
    bb[u]=1;
    v[b[uk].nom].push_back(u);
    //fout<<uk<<" "<<u<<endl;
    ll Min = 9999999999,jj=0;
    for(ll h=1;h<=n;h++)
    {
        if(!bb[h])
        {
            if(Min>raz(t[u],t[h]))
            {
                jj=h;
                Min=raz(t[u],t[h]);
            }
        }
    }
    if(jj==0)
    {
        return ;
    }
    if(d+Min<b[uk].l)
        s[b[uk].nom]=d+Min;
    dfs(jj,d+Min);
}
ifstream fin("wonderland.in");
ofstream fout("wonderland.out");
int main()
{
    ios :: sync_with_stdio(false);
    fin.tie(NULL);
    fout.tie(NULL);
    //freopen("wonderland.in", "r", stdin);
	//freopen("wonderland.out", "w", stdout);
    fin>>n;
    for(i=1;i<=n;i++)
    {
        fin>>t[i].x>>t[i].y;
    }
    fin>>m;
    for(i=1;i<=m;i++)
    {
        fin>>b[i].l>>b[i].r;
        b[i].nom=i;
    }
    sort(b+1,b+m+1,fff);
    fin>>T>>f;
    for(i=1;i<=f;i++)
    {
        fin>>a[i].a>>a[i].b>>a[i].c;
    }
    fin>>D;uk=1;
    for(i=1;i<=n;i++)
    {
        if(!bb[i])
        {
            dfs(i,0);
            if(v[b[uk].nom].size()==1)
            {
                v[b[uk].nom].pop_back();
                bb[i]=0;
                i--;uk++;
                continue;
            }
            s[b[uk].nom]+=b[uk].r;
            uk++;
        }
    }
    for(i=1;i<=m;i++)
    {
        fout<<v[i].size()<<" ";
        for(j=0;j<v[i].size();j++)
            fout<<v[i][j]<<" ";
        fout<<endl;
        if(v[i].size()==0)
        {
            fout<<0<<endl;
            continue;
        }
        q=s[i];
        p=(T-1)/q;k=1;
        if(k+(p+1)*q<=T)
            p++;
        fout<<p<<" ";
        for(j=1;j<=p;j++)
        {
            fout<<k<<" ";
            k+=q;
        }
        fout<<endl;
    }
    return 0;
}
/**
6
1 1
6 2
4 4
6 5
5 6
2 3
3
20 10
7 1
2 2
240 7
1 1 5
2 2 10
3 5 20
100 4 1
120 6 2
125 3 3
128 4 4
42



6
1 1
6 2
4 4
6 5
5 6
2 3
3
7 1
2 2
20 10
240 7
1 1 5
2 2 10
3 5 20
100 4 1
120 6 2
125 3 3
128 4 4
42
*/