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

#include <stdio.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 vis[MAXV][MAXV];
int mv[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};
int rtbl[MAXV][MAXV], ctbl[MAXV][MAXV];

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++) {
			rr = r + mv[i][0], cc = c + mv[i][1];
			if (rr < 0 || rr >= H || cc < 0 || cc >= W) continue;
			if      (i == 0) { if (!ctbl[r][c]) continue; }
			else if (i == 1) { if (!rtbl[r][c]) continue; }
			else if (i == 2) { if (!ctbl[rr][c]) continue; }
			else             { if (!rtbl[r][cc]) continue; }
			if (!vis[rr][cc]) enq(rr, cc, t+1);
		}
	}
	return -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; }

	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 (c1 < c2) rtbl[r1][c1]++, rtbl[r1][c2]--;
				else         rtbl[r1][c2]++, rtbl[r1][c1]--;
			} else {
				if (r1 < r2) ctbl[r1][c1]++, ctbl[r2][c1]--;
				else         ctbl[r2][c1]++, ctbl[r1][c1]--;
			}
			r1 = r2, c1 = c2;
		}
	}
	for (r1 = 0; r1 < H; r1++) for (c1 = 1; c1 <= W; c1++) rtbl[r1][c1] += rtbl[r1][c1-1];
	for (c1 = 0; c1 < W; c1++) for (r1 = 1; r1 <= H; r1++) ctbl[r1][c1] += ctbl[r1-1][c1];

	if ((k = dijkstra()) < 0) puts("Odekakedekinai..");
	else printf("%d\n", k);
	return 0;
}