#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
using Real=long double;
const int N=1e5+10;
const Real INF=1e12;
struct vec{
	Real x,y;
	vec(Real a=0,Real b=0):x(a),y(b){}
};
ostream& operator << (ostream &out,const vec &x){
	return out<<'('<<x.x<<','<<x.y<<')';
}
vec operator - (const vec &a,const vec &b){
	return vec(a.x-b.x,a.y-b.y);
}
vec operator + (const vec &a,const vec &b){
	return vec(a.x+b.x,a.y+b.y);
}
vec operator * (const vec &a,const Real &k){
	return vec(a.x*k,a.y*k);
}
Real dot(const vec &a,const vec &b){
	return a.x*b.x+a.y*b.y;
}
Real cross(const vec &a,const vec &b){
	return a.x*b.y-a.y*b.x;
}
vec common(vec a,vec b,vec x,vec y){
	Real p=cross(b-x,a-x),q=cross(a-y,b-y);
	return x*(q/(p+q))+y*(p/(p+q));
}
int where(const vec &a){
	if(!a.y)return a.x>0?0:2;
	else return a.y>0?1:3;
}
bool cmp(const vec &a,const vec &b){
	int p=where(a),q=where(b);
	return p^q?p<q:cross(a,b)>0;
}
int T,n,Ox,Oy;
struct half{
	vec s,t;
	int id;
}a[N];
ostream& operator << (ostream &out,const half &x){
	return out<<'{'<<x.id<<':'<<x.s<<"->"<<x.t<<'}';
}
int q[N],ans[N];
bool chk(int i,int j,int k){
	// vec x=a[i].t-a[i].s,y=a[j].t-a[j].s,z=a[k].t-a[k].s;
	// if(cross(x,y)<=0||cross(y,z)<=0)return 1;
	return cross(a[i].t-a[i].s,common(a[j].s,a[j].t,a[k].s,a[k].t)-a[i].s)>0;
}
int TT;
void get(){
	scanf("%d%d%d",&n,&Ox,&Oy),n--;
	for(int i=1,x,y;i<=n;i++){
		scanf("%d%d",&x,&y);
		x-=Ox,y-=Oy;
		a[i].s=vec(x,y);
		a[i].t=a[i].s+vec(-y,x);
		a[i].id=i;
	}
	if(++TT==5){
		cout<<n<<endl<<"0 0"<<endl;
		for(int i=1;i<=n;i++){
			cout<<a[i].s.x<<' '<<a[i].s.y<<endl;
		}
		exit(0);
	}
	a[++n]={vec(-INF,-INF),vec(INF,-INF),0};
	a[++n]={vec(INF,-INF),vec(INF,INF),0};
	a[++n]={vec(INF,INF),vec(-INF,INF),0};
	a[++n]={vec(-INF,INF),vec(-INF,-INF),0};
	sort(a+1,a+1+n,[](half x,half y){
		return cmp(x.t-x.s,y.t-y.s);
	});
	// debug(ary(a,1,n));
	// debug(chk(1,2,3));
	int L=1,R=0;
	for(int i=1;i<=n;i++){
		for(;L<R&&!chk(q[R-1],q[R],i);R--);
		q[++R]=i;
	}
	for(;L+1<R&&!chk(q[R],q[L],q[L+1]);L++);
	for(;L+1<R&&!chk(q[R-1],q[R],q[L]);R--);
	fill(ans+1,ans+1+n,0);
	for(int i=L;i<=R;i++)ans[a[q[i]].id]=1;
	int cnt=accumulate(ans+1,ans+1+n,0);
	if(T>10)return;
	printf("%d",cnt);
	for(int i=1;i<=n;i++){
		if(ans[i])printf(" %d",i);
	}
	puts("");
}
int main(){
	for(scanf("%d",&T);T--;)get();
	return 0;
}