#include <stdio.h>
#include<bits/stdc++.h>
using namespace std;
#include "nice_lines.h"
#define pb push_back
#define ld long double
#define ff first
#define ss second
void solve(int subtask_id, int N) {
vector<pair<int,int>>pts;
srand(time(0));
for(int i=0;i<3;i++){
pts.pb({rand()%100, rand()%100});
}
ld d1=query(pts[0].ff,pts[0].ss);
ld d2=query(pts[1].ff,pts[1].ss);
ld d3=query(pts[2].ff,pts[2].ss);
for(ld a=-10000;a<=10000;a++){
ld b1= d1*sqrt(a*a+1)+pts[0].ss-a*pts[0].ff;
ld b2= (-1)*d1*sqrt(a*a+1)+pts[0].ss-a*pts[0].ff;
b1= (int)b1;
b2= (int)b2;
ld B1= d2*sqrt(a*a+1)+pts[1].ss-a*pts[1].ff;
ld B2= (-1)*d1*sqrt(a*a+1)+pts[1].ss-a*pts[1].ff;
if(b1==B1){
the_lines_are({(int)a}, {(int)b1});
return;
}
if(b2==B2){
the_lines_are({(int)a}, {(int)b2});
return;
}
}
}
