#include 
     
      struct node{	int x;	int y;};node queue[100000];int ax[2]={0,0};int ay[2]={-1,1};int ax1[2]={-1,1};int ay1[2]={0,0};int head,tail,min;int map[60][60];int map1[60][60];int visit[60][60];int H,L,M;int qx,qy,zx,zy,flag,flag1;void en(node E){	queue[head++]=E;}node qe(){	return queue[tail++];}void chong(){	for(int i=0;i
      
       =0&&ns.x
       
        =0&&ns.y
        
         =0&&ns.x
         
          =0&&ns.y
         
        
       
      
     

 5 3

1 1 3

1 1 1

0 0 0

0 0 0

2 1 1