#include <bits/stdc++.h>
#define pb(x) push_back(x)
const int maxn = 200000+5;
const int lim = 15;
typedef long long ll;
using namespace std;
int n;
struct qq{int opt;ll x,y;}Q[maxn];
struct node{int id;ll x,y;node(){}node(ll a,ll b,int c){x=a;y=b;id=c;}bool operator < (const node a)const{if(a.x==x)return y < a.y;return x < a.x;}
};
set<node>s;
set<node>::iterator it,it1;
ll dis(ll x1,ll y1,ll x2,ll y2){return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
}
ll in_cir(ll x1,ll y1,ll x2,ll y2){if(dis(x1,y1,x2,y2)<y1*y1)return 1;return 0;
}
int main()
{scanf("%d",&n);for(int i=1;i<=n;++i){int opt;ll x,y;scanf("%d%I64d%I64d",&opt,&x,&y);Q[i].opt=opt;Q[i].x=x;Q[i].y=y;}for(int i=1;i<=n;++i){if(Q[i].opt==1)s.insert(node(Q[i].x,Q[i].y,i));else{int cc=0,ans=-1;it = s.lower_bound(node(Q[i].x,0,0));for(;it!=s.end()&&cc<=lim;++cc,++it){if(in_cir((*it).x,(*it).y,Q[i].x,Q[i].y)){s.erase(it);ans=(*it).id;break;}}cc=0;it1=s.lower_bound(node(Q[i].x,0,0));for(;it1!=s.begin()&&cc<=lim;--it1,++cc){if(in_cir((*it1).x,(*it1).y,Q[i].x,Q[i].y)){s.erase(it1);ans=(*it1).id;break;}}it1=s.begin();if(in_cir((*it1).x,(*it1).y,Q[i].x,Q[i].y)){s.erase(it1);ans=(*it1).id;}printf("%d\n",ans);}}return 0;
}

#include <bits/stdc++.h>
using namespace std;
int a[3],w,h,ww,hh;
bool ck1(){ww=a[1]*2+a[2]*2;hh=a[0]+a[2]*2;if(ww<=w&&hh<=h)return 1;ww=a[1]*2+a[2]*2;hh=a[0]+a[1]+a[2];if(ww<=w&&hh<=h)return 1;ww=a[0]+a[1]+a[2]*3;hh=a[0]+a[1];if(ww<=w&&hh<=h)return 1;ww=a[0]+a[1]+a[2]*2;hh=a[0]+a[1]+a[2];if(ww<=w&&hh<=h)return 1;ww=a[0]+a[1]*2+a[2];hh=a[0]+a[2]*2;if(ww<=w&&hh<=h)return 1;ww=a[0]*2+a[1]+a[2];hh=a[0]+a[1]+a[2];if(ww<=w&&hh<=h)return 1;ww=a[0]*2+a[1];hh=a[0]+a[1]+a[2]*2;if(ww<=w&&hh<=h)return 1;return 0;
}
bool ck(){sort(a,a+3);for(int ti=0;ti<6;++ti){if(ck1())return 1;next_permutation(a,a+3);}return 0;
}
int main()
{scanf("%d%d%d%d%d",&a[0],&a[1],&a[2],&w,&h);if(ck()){puts("Yes");return 0;}swap(w,h);if(ck()){puts("Yes");return 0;}puts("No");return 0;
}

#include <bits/stdc++.h>
#define pb(x) push_back(x)
typedef long long ll;
const int maxn = 300000+7;
using namespace std;
int n,m;
struct edge{int u,v,nxt;}E[maxn][2];
int h[maxn][2],cc;
void add(int u,int v){++cc;E[cc][0].u=u;E[cc][0].v=v;E[cc][0].nxt=h[u][0];h[u][0]=cc;E[cc][1].u=v;E[cc][1].v=u;E[cc][1].nxt=h[v][1];h[v][1]=cc;
}
bool vis[maxn],used[maxn];int stc[maxn],tp;
void dfs1(int u){vis[u]=1;for(int i=h[u][0];~i;i=E[i][0].nxt){int v=E[i][0].v;if(!vis[v]){used[i]=1;dfs1(v);}}stc[++tp]=u;
}
void dfs2(int u){vis[u]=0;for(int i=h[u][1];~i;i=E[i][1].nxt){int v=E[i][1].v;if(vis[v]){used[i]=1;dfs2(v);}}
}
int T;
int main()
{scanf("%d",&T);while(T--){scanf("%d%d",&n,&m);cc=tp=0;memset(h,-1,sizeof(h));memset(used,0,sizeof(used));for(int i=1;i<=m;++i){int x,y;scanf("%d%d",&x,&y);add(x,y);}for(int i=1;i<=n;++i)if(!vis[i])dfs1(i);for(int i=n;i>=1;--i)if(vis[stc[i]])dfs2(stc[i]);int tn = 2*n;for(int i=1;i<=m;++i)if(used[i])--tn;for(int i=1;i<=m;++i)if(!used[i]&&tn>0)--tn,used[i]=1;for(int i=1;i<=m;++i)if(!used[i]){printf("%d %d\n",E[i][0].u,E[i][0].v);}}return 0;
}