#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int W; int H; int N;
	while(~scanf("%d%d%d", &W, &H, &N)) {
		vector<vi> vert(H, vi(W)), hori(H, vi(W));
		rep(ii, N) {
			int M;
			scanf("%d", &M);
			int prevB = -1;
			for(int i = 0; i < M + 1; ++ i) {
				int B;
				scanf("%d", &B);
				if(prevB != -1) {
					if(prevB / W == B / W) {
						pii p = minmax(prevB % W, B % W);
						++ hori[B / W][p.first];
						-- hori[B / W][p.second];
					} else {
						pii p = minmax(prevB / W, B / W);
						++ vert[p.first][B % W];
						-- vert[p.second][B % W];
					}
				}
				prevB = B;
			}
		}
		rep(i, H) rep(j, W - 1)
			hori[i][j + 1] += hori[i][j];
		rep(j, W) rep(i, H - 1)
			vert[i + 1][j] += vert[i][j];
		vector<bool> vis(H * W);
		vi q, nq;
		nq.push_back(0);
		int ans = INF, d = 0;
		while(!nq.empty()) {
			q.swap(nq);
			while(!q.empty()) {
				int i = q.back(); q.pop_back();
				if(vis[i]) continue;
				vis[i] = true;
				if(i == H * W - 1) {
					ans = d;
					nq.clear();
					break;
				}
				int y = i / W, x = i % W;
				static const int dy[4] = { 0, 1, 0, -1 }, dx[4] = { 1, 0, -1, 0 };
				for(int d = 0; d < 4; ++ d) {
					int yy = y + dy[d], xx = x + dx[d];
					if(yy < 0 || yy >= H || xx < 0 || xx >= W) continue;
					if(dy[d] != 0) {
						if(vert[min(y, yy)][x] == 0) continue;
					} else {
						if(hori[yy][min(x, xx)] == 0) continue;
					}
					nq.push_back(yy * W + xx);
				}
			}
			++ d;
		}
		if(ans == INF)
			puts("Odekakedekinai..");
		else
			printf("%d\n", ans);
	}
	return 0;
}