// yukicoder: No.340 雪の足跡
// 2019.7.28 bal4u

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#if 1
#define gc() getchar_unlocked()
#else
#define gc() getchar()
#endif

int in() {   // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

//// 優先度付きキュー（ダイクストラ法用）
#define MAX 1000000
typedef struct { int t, r, c; } QUE;
QUE que[MAX]; int qsize;

#define PARENT(i) ((i)>>1)
#define LEFT(i)   ((i)<<1)
#define RIGHT(i)  (((i)<<1)+1)

void min_heapify(int i) {
	int l, r, min;
	QUE qt;

	l = LEFT(i), r = RIGHT(i);
	if (l < qsize && que[l].t < que[i].t) min = l; else min = i;
	if (r < qsize && que[r].t < que[min].t) min = r;
	if (min != i) {
		qt = que[i]; que[i] = que[min]; que[min] = qt;
		min_heapify(min);
	}
}

void deq() {
	que[0] = que[--qsize];
	min_heapify(0);
}

void enq(int r, int c, int t) {
	int i, min;
	QUE qt;

	i = qsize++;
	que[i].t = t, que[i].r = r, que[i].c = c;
	while (i > 0 && que[min = PARENT(i)].t > que[i].t) {
		qt = que[i]; que[i] = que[min]; que[min] = qt;
		i = min;
	}
}

//// 本問題関連
#define MAXV 1003
int W, H;
char to[MAXV][MAXV][4];
char vis[MAXV][MAXV];
int rmi[MAXV], rma[MAXV], cmi[MAXV], cma[MAXV];
int mv[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};

int dijkstra() {
	int i, r, c, rr, cc, t;

	enq(0, 0, 0);
	while (qsize) {
		r = que[0].r, c = que[0].c, t = que[0].t, deq();
//printf("(%d,%d), t=%d, qsize=%d\n", r, c, t, qsize);
		if (r == H-1 && c == W-1) return t;
		if (vis[r][c]) continue;
		vis[r][c] = 1;
		for (i = 0; i < 4; i++) if (to[r][c][i]) {
			rr = r + mv[i][0], cc = c + mv[i][1];
			if (!vis[rr][cc]) enq(rr, cc, t+1);
		}
	}
	return -1;
}

void rset(int r, int mi, int ma) {
	while (mi < ma) to[r][mi++][1] = 1, to[r][mi][3] = 1;
}

void cset(int c, int mi, int ma) {
	while (mi < ma) to[mi++][c][0] = 1, to[mi][c][2] = 1;
}


int main()
{
	int k, N, M, b1, b2, r1, c1, r2, c2;
	
	W = in(), H = in(), N = in();
	if (N == 0) { puts(W*H == 1? "0": "Odekakedekinai.."); return 0; }

	memset(rmi, 0x11, sizeof(rmi));
	memset(cmi, 0x11, sizeof(cmi));
	while (N--) {
		M = in(), b1 = in(), r1 = b1/W, c1 = b1%W;
		while (M--) {
			b2 = in(), r2 = b2/W, c2 = b2%W;
			if (r1 == r2) {
				if (rmi[r1] > rma[r2]) rmi[r1] = rma[r1] = c1;
				else if (c1 > rma[r1]) rma[r1] = c1;
				else if (c1 < rmi[r1]) rmi[r1] = c1;
				if (c2 > rma[r1]) rma[r1] = c2;
				else if (c2 < rmi[r1]) rmi[r1] = c2;
			} else {
				if (cmi[c1] > cma[c2]) cmi[c1] = cma[c1] = r1;
				else if (r1 > cma[c1]) cma[c1] = r1;
				else if (r1 < cmi[c1]) cmi[c1] = r1;
				if (r2 > cma[c1]) cma[c1] = r2;
				else if (r2 < cmi[c1]) cmi[c1] = r2;
			}
			r1 = r2, c1 = c2;
		}
	}
	for (r1 = 0; r1 < H; r1++) rset(r1, rmi[r1], rma[r1]);
	for (c1 = 0; c1 < W; c1++) cset(c1, cmi[c1], cma[c1]);
	
	if ((k = dijkstra()) < 0) puts("Odekakedekinai..");
	else printf("%d\n", k);
	return 0;
}