#include <stdio.h>
#include <stdlib.h>
#include <tuple>
#include <queue>
#include <algorithm>

using namespace std;

typedef tuple <int,int,int> T;

#define range(i,a,b) for(int i=(a); i < (b); i++)
#define rep(i,n) range(i,0,n)

#define UW 1000
#define UH 1000
#define UN 1000
#define UM 1000
#define MAXD 1000001

int EX[UH][UW],EY[UW][UH];
int D[UH][UW], dx[] = {1,0,-1,0}, dy[] = {0,1,0,-1};
int main(){
	int W,H,N,M,x,y,nx,ny,d,G;
	queue<T> Q;
	scanf("%d %d %d",&W,&H,&N);
	if (W<1||W>UW||H<1||H>UH||N<0||N>UN){printf("NG!(1)\n");exit(1);}
	rep(j,H) rep(i,W){ EX[j][i]=EY[i][j]=0; D[j][i]=MAXD;}
	rep(i,N){
		scanf("%d",&M);scanf("%d %d",&x,&y);
		if(M<1||M>UM||x<0||x>=W||y<0||y>=H){printf("NG!(2)\n");exit(1);}
		rep(i,M){
			scanf("%d %d",&nx,&ny);
			if(nx<0||nx>=W||ny<0||ny>=H){printf("NG!(3)\n");exit(1);}
			if(!((x==nx && y!=ny)||(x!=nx && y==ny))){
				printf("NG!(4): (%d,%d)->(%d,%d)\n",x,y,nx,ny);
				exit(1);
			}
			if (y == ny){EX[y][min(x,nx)]++;EX[y][max(x,nx)]--;}
			else {EY[x][min(y,ny)]++;EY[x][max(y,ny)]--;}
			x = nx; y = ny;
		}
	}
	rep(j,H) rep(i,W-1) EX[j][i+1] += EX[j][i];
	rep(i,W) rep(j,H-1) EY[i][j+1] += EY[i][j];
	D[0][0] = 0; Q.push(T(0,0,0)); G = W+H-2;
	while (!Q.empty()){
		tie(x,y,d) = Q.front(); Q.pop();
		if (x+y == G){printf("%d\n",d); return 0;}
		rep(i,4){
			nx = x + dx[i]; ny = y + dy[i];
			if (nx < 0 || nx >= W || ny < 0 || ny >= H) continue;
			if (((x==nx && EY[x][min(y,ny)]>0)||(y==ny && EX[y][min(x,nx)]>0)) && d+1<D[ny][nx]){
				D[ny][nx] = d+1; Q.push(T(nx,ny,d+1));
			} 
		}
	}
	puts("Odekakedekinai..");
	return 0;
}