//~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC target ("avx2")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//~ #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define shandom_ruffle random_shuffle

using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
const int nax=1000*1007;
const ll mod=1000*1000*1000+7;
const int inf=1007*1007*1007;

int n, q;

struct vec
{
	ll w[3];
	vec()
	{
		for (int i=0; i<3; i++)
			w[i]=0;
	}
	void czyt()
	{
		for (int i=0; i<3; i++)
			scanf("%lld", &w[i]);
	}
	void reset()
	{
		for (int i=0; i<3; i++)
			w[i]=0;
	}
};

struct mac
{
	ll w[3][3];
	int pusta=0;
	mac()
	{
		for (int i=0; i<3; i++)
			for (int j=0; j<3; j++)
				w[i][j]=0;
	}
	void czyt()
	{
		for (int i=0; i<3; i++)
			for (int j=0; j<3; j++)
				scanf("%lld", &w[i][j]);
	}
	void reset()
	{
		if (pusta)
			return;
		for (int i=0; i<3; i++)
			for (int j=0; j<3; j++)
				w[i][j]=(i==j);
		pusta=1;
	}
};

ll pom[3][3];

void domnoz(const mac &a, mac &b)
{
	if (a.pusta)
		return;
	if (b.pusta)
	{
		for (int i=0; i<3; i++)
			for (int j=0; j<3; j++)
				b.w[i][j]=a.w[i][j];
		b.pusta=0;
		return;
	}
	for (int i=0; i<3; i++)
		for (int j=0; j<3; j++)
			pom[i][j]=0;
	for (int i=0; i<3; i++)
		for (int j=0; j<3; j++)
			for (int l=0; l<3; l++)
				pom[i][l]+=a.w[i][j]*b.w[j][l];
	for (int i=0; i<3; i++)
		for (int j=0; j<3; j++)
			b.w[i][j]=pom[i][j]%mod;
}

pii tab[nax];
vec vectab[nax];

int m;

pii px[nax];
pii py[nax];
mac narz[nax];
vec pod[nax];
vi dz[nax];

void push(int v)
{
	for (int i : dz[v])
		domnoz(narz[v], narz[i]);
	narz[v].reset();
}

void dodaj(const mac &a, const vec &b, vec &c)
{
	if (a.pusta)
	{
		for (int i=0; i<3; i++)
			c.w[i]+=b.w[i];
	}
	else
	{
		for (int i=0; i<3; i++)
			for (int j=0; j<3; j++)
				c.w[i]+=a.w[i][j]*b.w[j];
	}
	for (int i=0; i<3; i++)
		c.w[i]%=mod;
}

void upd(int v)
{
	pod[v].reset();
	for (int i : dz[v])
		dodaj(narz[i], pod[i], pod[v]);
}

int nal[nax];

vector<pii> otogor[nax];
vector<pii> otodol[nax];

int ma, mb;

int mniej(int a, int b)
{
	int wa=tab[a].first*ma+tab[a].second*mb;
	int wb=tab[b].first*ma+tab[b].second*mb;
	if (wa!=wb)
		return wa<wb;
	return tab[a]<tab[b];
}

int pga[nax];
int pgb[nax];
int pgc[nax];
mac pmac[nax];

int build(vi wek)
{
	if (wek.empty())
		return 0;
	if ((int)wek.size()==1)
	{
		int kt=wek[0];
		m++;
		pod[m]=vectab[kt];
		narz[m].reset();
		px[m]={tab[kt].first, tab[kt].first};
		py[m]={tab[kt].second, tab[kt].second};
		return m;
	}
	int r=wek.size();
	
	const int ile=2;
	
	int kt=rand()%q+1;
	ma=pga[kt];
	mb=pgb[kt];
	if (rand()&1)
	{
		ma*=-1;
		mb*=-1;
	}
	
	sort(wek.begin(), wek.end(), mniej);
	
	for (int i=0; i<r; i++)
		nal[wek[i]]=(ile*i)/r;
	
	vector<vi> podz(ile);
	
	for (int i : wek)
		podz[nal[i]].push_back(i);
	
	m++;
	int tu=m;
	for (int h=0; h<ile; h++)
	{
		dz[tu].push_back(build(podz[h]));
		if (!dz[tu].back())
			dz[tu].pop_back();
	}
	
	px[tu]={inf, -inf};
	py[tu]={inf, -inf};
	for (int i : dz[tu])
	{
		px[tu].first=min(px[tu].first, px[i].first);
		px[tu].second=max(px[tu].second, px[i].second);
		
		py[tu].first=min(py[tu].first, py[i].first);
		py[tu].second=max(py[tu].second, py[i].second);
	}
	
	narz[tu].reset();
	upd(tu);
	return tu;
}

int ga, gb, gc;

mac glomac;
vec wyn;

int eval(pii v)
{
	return ga*v.first+gb*v.second;
}

int czytak(const vector<pii> &wek)
{
	int r=wek.size();
	int bsa=0;
	int bsb=r-1;
	while(bsa<bsb)
	{
		int bss=(bsa+bsb)>>1;
		int el=eval(wek[bss]);
		int ep=eval(wek[bss+1]);
		if (min(el, ep)<gc)
			return 1;
		if (el<ep)
			bsb=bss;
		else
			bsa=bss+1;
	}
	return eval(wek[bsa])<gc;
}

void szuk(int v)
{
	//~ int mini=min(minimum(otodol[v]), minimum(otogor[v]));
	//~ ga*=-1;
	//~ gb*=-1;
	//~ int maxi=-min(minimum(otodol[v]), minimum(otogor[v]));
	//~ ga*=-1;
	//~ gb*=-1;
	
	//~ int mini=min(ga*px[v].first, ga*px[v].second)+min(gb*py[v].first, gb*py[v].second);
	//~ int maxi=max(ga*px[v].first, ga*px[v].second)+max(gb*py[v].first, gb*py[v].second);
	//~ if (mini>=gc)
	//~ {
		//~ return;
	//~ }
	//~ if (maxi<gc)
	//~ {
		//~ dodaj(narz[v], pod[v], wyn);
		//~ domnoz(glomac, narz[v]);
		//~ return;
	//~ }
	
	int natak=0;
	int nanie=0;
	
	if (gb>0)
	{
		natak=czytak(otodol[v]);
		ga*=-1;
		gb*=-1;
		gc*=-1;
		nanie=czytak(otogor[v]);
		ga*=-1;
		gb*=-1;
		gc*=-1;
	}
	else
	{
		natak=czytak(otogor[v]);
		ga*=-1;
		gb*=-1;
		gc*=-1;
		nanie=czytak(otodol[v]);
		ga*=-1;
		gb*=-1;
		gc*=-1;
	}
	
	assert(natak || nanie);
	
	if (!natak)
	{
		return;
	}
	if (!nanie)
	{
		dodaj(narz[v], pod[v], wyn);
		domnoz(glomac, narz[v]);
		return;
	}
	
	assert(!dz[v].empty());
	push(v);
	for (int i : dz[v])
		szuk(i);
	upd(v);
}

vector<pii> glopun;

ll ilowek(pii s, pii a, pii b)
{
	a.first-=s.first;
	a.second-=s.second;
	b.first-=s.first;
	b.second-=s.second;
	return a.first*(ll)b.second-a.second*(ll)b.first;
}

void otoczkuj()
{
	sort(glopun.begin(), glopun.end());
	static vector<pii> oto;
	oto.clear();
	for (pii i : glopun)
	{
		int r=oto.size();
		if (r && i==oto.back())
			continue;
		while(r>=2 && ilowek(oto[r-2], oto[r-1], i)>=0)
		{
			oto.pop_back();
			r--;
		}
		oto.push_back(i);
	}
	oto.swap(glopun);
}

int main()
{
	scanf("%d", &n);
	for (int i=1; i<=n; i++)
	{
		int x, y;
		vec w;
		scanf("%d%d", &x, &y);
		tab[i]={x, y};
		vectab[i].czyt();
	}
	scanf("%d", &q);
	for (int i=1; i<=q; i++)
	{
		scanf("%d%d%d", &pga[i], &pgb[i], &pgc[i]);
		pmac[i].czyt();
	}
	vi k1;
	for (int i=1; i<=n; i++)
		k1.push_back(i);
	int korz=build(k1);
	for (int i=m; i; i--)
	{
		if (dz[i].empty())
		{
			otogor[i]=otodol[i]={{px[i].first, py[i].first}};
			continue;
		}
		glopun.clear();
		for (int j : dz[i])
			for (pii l : otogor[j])
				glopun.push_back(l);
		otoczkuj();
		otogor[i]=glopun;
		
		glopun.clear();
		for (int j : dz[i])
			for (pii l : otodol[j])
				glopun.push_back(l);
		for (pii &j : glopun)
		{
			j.first*=-1;
			j.second*=-1;
		}
		otoczkuj();
		for (pii &j : glopun)
		{
			j.first*=-1;
			j.second*=-1;
		}
		otodol[i]=glopun;
	}
	for (int h=1; h<=q; h++)
	{
		ga=pga[h];
		gb=pgb[h];
		gc=pgc[h];
		glomac=pmac[h];
		wyn=vec();
		
		szuk(korz);
		
		for (int i=0; i<3; i++)
			printf("%lld ", wyn.w[i]);
		printf("\n");
	}
	return 0;
}