//~ 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;

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]);
	}
};

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

vec operator +(const vec &a, const vec &b)
{
	vec ret=vec();
	for (int i=0; i<3; i++)
		ret.w[i]=(a.w[i]+b.w[i])%mod;
	return ret;
}

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

vec operator *(const mac &a, const vec &b)
{
	vec ret=vec();
	for (int i=0; i<3; i++)
		for (int j=0; j<3; j++)
			ret.w[i]=(ret.w[i]+a.w[i][j]*b.w[j])%mod;
	return ret;
}

pll tab[nax];
vec vectab[nax];

bool mniej1(int a, int b)
{
	return tab[a]<tab[b];
}

bool mniej2(int a, int b)
{
	pll aa=tab[a];
	pll bb=tab[b];
	swap(aa.first, aa.second);
	swap(bb.first, bb.second);
	return aa<bb;
}

int m;

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

vec daj(int v)
{
	return narz[v]*pod[v];
}

void push(int v)
{
	for (int i : dz[v])
		narz[i]=narz[v]*narz[i];
	narz[v]=mac(1);
}

void upd(int v)
{
	pod[v]=daj(dz[v][0])+daj(dz[v][1]);
}

int nal[nax];

int build(vector<vi> wek, int parz)
{
	if ((int)wek[0].size()==1)
	{
		int kt=wek[0][0];
		m++;
		pod[m]=vectab[kt];
		narz[m]=mac(1);
		px[m]={tab[kt].first, tab[kt].first};
		py[m]={tab[kt].second, tab[kt].second};
		return m;
	}
	int r=wek[0].size();
	for (int i=0; i<r; i++)
		nal[wek[parz][i]]=(2*i<r);
	
	vector<vector<vi>> podz(2, vector<vi>(2));
	
	for (int h=0; h<2; h++)
		for (int i : wek[h])
			podz[nal[i]][h].push_back(i);
	
	m++;
	int tu=m;
	dz[tu].push_back(build(podz[0], parz^1));
	dz[tu].push_back(build(podz[1], parz^1));
	px[tu]={min(px[dz[tu][0]].first, px[dz[tu][1]].first), max(px[dz[tu][0]].second, px[dz[tu][1]].second)};
	py[tu]={min(py[dz[tu][0]].first, py[dz[tu][1]].first), max(py[dz[tu][0]].second, py[dz[tu][1]].second)};
	pod[tu]=daj(dz[tu][0])+daj(dz[tu][1]);
	narz[tu]=mac(1);
	return tu;
}

ll ga, gb, gc;

mac glomac;
vec wyn;

void szuk(int v)
{
	ll mini=min(ga*px[v].first, ga*px[v].second)+min(gb*py[v].first, gb*py[v].second);
	ll 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)
	{
		wyn=wyn+daj(v);
		narz[v]=glomac*narz[v];
		return;
	}
	assert(!dz[v].empty());
	push(v);
	for (int i : dz[v])
		szuk(i);
	upd(v);
}

int main()
{
	scanf("%d", &n);
	for (int i=1; i<=n; i++)
	{
		ll x, y;
		vec w;
		scanf("%lld%lld", &x, &y);
		tab[i]={x, y};
		vectab[i].czyt();
	}
	vi k1, k2;
	for (int i=1; i<=n; i++)
		k1.push_back(i);
	k2=k1;
	sort(k1.begin(), k1.end(), mniej1);
	sort(k2.begin(), k2.end(), mniej2);
	int korz=build({k1, k2}, 0);
	scanf("%d", &q);
	while(q--)
	{
		scanf("%lld%lld%lld", &ga, &gb, &gc);
		glomac.czyt();
		wyn=vec();
		
		szuk(korz);
		
		for (int i=0; i<3; i++)
			printf("%lld ", wyn.w[i]);
		printf("\n");
	}
	return 0;
}