#include 
#include 
#include 
#include 
#include 

using namespace std;

struct node{
int x;
int y;
int distance;
node(){

}
node(int _x, int _y, int _distance){
x=_x;
y=_y;
distance=_distance;
}
bool operator <(const node& temp)const{
return distance>n;
cin>>m;
char matrica[n][m];
bool visited[n][m];
int sy;
int sx;
int ex;
int ey;
int distance[n][m];
vector>v;
priority_queuepq;
queueq;
for(int y=0; y>matrica[x][x1];
      if(matrica[x][x1]=='G'){
        q.push(x);
        q.push(x1);
        q.push(0);
      }
        if(matrica[x][x1]=='R'){
        sx=x;
        sy=x1;
      }
      if(matrica[x][x1]=='Z'){
        ex=x;
        ey=x1;
      }
}
}
for(int h=0; h=0)and(ty>=0)and(tx=0)and(tx>=0)and(tx