#include <bits/stdc++.h>
using namespace std;
const int n=666;
int kx,ky,tx,ty,vi[1100][1100];
int dx[5],dy[5],tot;
struct node
{int x,y;
}sh[1000];
struct dir
{int num,wh;
}a[6];
bool cmp(dir a,dir b)
{return (a.num<b.num);
}
bool run()
{tot++;if (vi[kx+tx][ky+ty]){printf("%d %d\n",kx+tx,ky);fflush(stdout);int a,b,c;scanf("%d%d%d",&a,&b,&c);return 1;}printf("%d %d\n",kx+tx,ky+ty);kx+=tx;ky+=ty;fflush(stdout);int k,x,y;scanf("%d%d%d",&k,&x,&y);if (k==-1)return 1;vi[sh[k].x][sh[k].y]--;sh[k].x=x;sh[k].y=y;vi[sh[k].x][sh[k].y]++;return 0;
}
int main()
{scanf("%d%d",&kx,&ky);for (int i=1;i<=n;i++)scanf("%d%d",&sh[i].x,&sh[i].y);for (int i=1;i<=n;i++)vi[sh[i].x][sh[i].y]++;//注意有可能多个在一起if (kx<500)tx=1;if (kx>500)tx=-1;if (ky<500)ty=1;if (ky>500)ty=-1;while (1){if (kx==500 || ky==500)break;if (run())return 0;}if (kx==500 && ky!=500){tx=0;if (ky>500)ty=-1;elsety=1;}if (kx!=500 && ky==500){ty=0;if (kx<500)tx=1;elsetx=-1;}while (1){if (kx==500 && ky==500)break;if (run())return 0;}for (int i=1;i<=499;i++){for (int j=1;j<=499;j++){if (vi[i][j]){a[1].num+=vi[i][j];//left upa[1].wh=1;}}}for (int i=1;i<=499;i++){for (int j=501;j<=999;j++){if (vi[i][j]){a[2].num+=vi[i][j];//right upa[2].wh=2;}}}for (int i=501;i<=999;i++){for (int j=501;j<=999;j++){if (vi[i][j]){a[3].num+=vi[i][j];//right downa[3].wh=3;}}}for (int i=501;i<=999;i++){for (int j=1;j<=499;j++){if (vi[i][j]){a[4].num+=vi[i][j];//left downa[4].wh=4;}}}for (int i=1;i<=4;i++)a[i].wh=i;dx[1]=1;dx[2]=1;dx[3]=-1;dx[4]=-1;dy[1]=1;dy[2]=-1;dy[3]=-1;dy[4]=1;sort(a+1,a+1+4,cmp);tx=dx[a[1].wh];ty=dy[a[1].wh];while (1){if (run())return 0;if (kx==1 || kx==999 || ky==0 || ky==999)break;}tx=-tx;ty=-ty;while (tot<=2000){if (run())return 0;if (kx==1 || kx==999 || ky==0 || ky==999)break;}
}