1/* ***********************************************
  2Author :111qqz
  3Created Time :2017年10月08日 星期日 18时43分38秒
  4File Name :5992.cpp
  5************************************************ */
  6
  7#include <cstdio>
  8#include <cstring>
  9#include <iostream>
 10#include <algorithm>
 11#include <vector>
 12#include <queue>
 13#include <set>
 14#include <map>
 15#include <string>
 16#include <cmath>
 17#include <cstdlib>
 18#include <ctime>
 19#define PB push_back
 20#define fst first
 21#define sec second
 22#define lson l,m,rt<<1
 23#define rson m+1,r,rt<<1|1
 24#define ms(a,x) memset(a,x,sizeof(a))
 25typedef long long LL;
 26#define pi pair < int ,int >
 27#define MP make_pair
 28
 29using namespace std;
 30const double eps = 1E-8;
 31const int dx4[4]={1,0,0,-1};
 32const int dy4[4]={0,-1,1,0};
 33const int inf = 0x3f3f3f3f;
 34const int N=2E5+7;
 35int n,m;
 36struct Point
 37{
 38    LL x,y;
 39    int c;
 40    int id;
 41}p[N]; 
 42bool dv[N]; //划分方式
 43bool cmpx( const Point & p1, const Point &p2)
 44{
 45    return p1.x<p2.x;
 46}
 47bool cmpy(const Point &p1 ,const Point &p2)
 48{
 49    return p1.y<p2.y;
 50}
 51LL getDis( Point a, Point b)
 52{
 53    return (a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y);
 54}
 55void build ( int l,int r)
 56{
 57    if (l>r) return;
 58    int mid = (l+r) >> 1;
 59    int minx = min_element(p+l,p+r,cmpx)->x;
 60    int miny = min_element(p+l,p+r,cmpy)->y;
 61    int maxx = max_element(p+l,p+r,cmpx)->x;
 62    int maxy = max_element(p+l,p+r,cmpy)->y;
 63    dv[mid] = maxx-minx >= maxy-miny;
 64    nth_element(p+l,p+mid,p+r+1,dv[mid]?cmpx:cmpy);
 65    build(l,mid-1);
 66    build(mid+1,r);
 67
 68}
 69LL res,ansid;
 70void query( int l,int r,Point a)
 71{
 72    if (l>r) return;
 73    int mid = (l+r)>>1;
 74    LL dis = getDis(a,p[mid]);
 75    //printf("%lld %lld  %lld %lld    %lld\n",a.x,a.y,p[mid].x,p[mid].y,dis);
 76    if (a.c>=p[mid].c)
 77    {
 78    if (dis<res) res = dis,ansid = mid;
 79    else if (dis==res&&p[mid].id<p[ansid].id) ansid = mid;
 80    }
 81    LL d = dv[mid]?(a.x-p[mid].x):(a.y-p[mid].y);
 82    int l1=l,r1=mid-1,l2=mid+1,r2=r;
 83    if (d>0) swap(l1,l2),swap(r1,r2);
 84    query(l1,r1,a); //左儿子
 85    if (d*d<res) query(l2,r2,a);//如果与分界线相交，则也要查询右儿子。
 86}
 87
 88int main()
 89{
 90    #ifndef  ONLINE_JUDGE 
 91    freopen("./in.txt","r",stdin);
 92  #endif
 93    int T;
 94    cin>>T;
 95    while (T--)
 96    {
 97        scanf("%d%d",&n,&m);
 98        for ( int i = 1 ; i <= n ; i++) {
 99        scanf("%lld %lld %d",&p[i].x,&p[i].y,&p[i].c);
100        p[i].id = i;
101        }
102        build (1,n);
103        while (m--)
104        {
105
106        res = 1LL<<60;
107        Point p2;
108        scanf("%lld%lld%d",&p2.x,&p2.y,&p2.c);
109        query(1,n,p2);
110        printf("%lld %lld %d\n",p[ansid].x,p[ansid].y,p[ansid].c);
111        }
112
113    }
114  #ifndef ONLINE_JUDGE  
115  fclose(stdin);
116  #endif
117    return 0;
118}