#include <cstdio>
#include <queue>
#include <map>
#include <vector>
#include <algorithm>

using namespace std;

int visit[1001][1001]={},mp[1001][1001]={}; 
int main(){
	int w,h,n;scanf("%d%d%d",&w,&h,&n);
	for(int i=0;i<n;i++){
		int m,sx,sy,x,y,a,b,d;scanf("%d%d",&m,&a);
		sx=a%w;sy=a/w;
		for(int j=0;j<m;j++){
			scanf("%d",&b);x=b%w;y=b/w;
			if(sx==x){
				if(sy<y)d=1;else d=-1; 
				for(;sy!=y;sy+=d){
					if(mp[sy][x])continue;
					mp[sy][x]=1;
					/*v[a].push_back(a+d);
					v[a+d].push_back(a);*/
				}
			}
			else if(sy==y){
				if(sx<x)d=1;else d=-1;
				for(;sx!=x;sx+=d){
					if(mp[y][sx])continue;
					mp[y][sx]=1;
					/*v[a].push_back(a+d);
					v[a+d].push_back(a);*/
				}
			}
			a=b;sx=x;sy=y;
		}
	}
	
	queue< vector<int> > q;
	q.push({0,0});
	visit[0][0]=1;
	vector<int> a,g{w-1,h-1};int cnt=0,num=1,ncnt=0;
	int dx[4]={0,0,-1,1},dy[4]={-1,1,0,0},x,y;
	while(q.size()){
		a=q.front();q.pop();
		if(a==g){num=0;break;}
		num--;
		for(int i=0;i<4;i++){
			x=a[0]+dx[i];if(x<0||x>=w)continue;
			y=a[1]+dy[i];if(y<0||y>=h)continue;
			if(visit[y][x]==0){ncnt++;visit[y][x]=1;q.push({x,y});}
		}
		if(num==0){cnt++;num=ncnt;ncnt=0;}
	}
	if(num>0)printf("Odekakedekinai..\n");
	else printf("%d\n",cnt);
	return 0;
}