#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)

//横縦横縦
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
vector<int> b[1001];
vector<int> miti[1000000];
int memo[1001][1001];//(0, 0)からの最短経路を保存しておく
int main(void){
	int w, h, n; cin >> w >> h >> n;
	if(w == 1 && h == 1){
		printf("0\n"); return 0;
	}
	rep(i, n){
		int m; cin >> m;
		rep(j, m + 1){
			int tmp; cin >> tmp;
			b[i].push_back(tmp);
		}
	}

	//通れる道を探す
	for (int i = 0; i < n; ++i){
		for (int j = 0; j < b[i].size() - 1; ++j){
			miti[b[i][j]].push_back(b[i][j + 1]);
			miti[b[i][j + 1]].push_back(b[i][j]);
		}
	}

	//通れる道を探す
	for (int i = 0; i < n; ++i){
		for (int j = 0; j < b[i].size() - 1; ++j){
			int ma, mi;
			if(b[i][j] > b[i][j + 1]){
				ma = b[i][j]; mi = b[i][j + 1];
			}else{
				mi = b[i][j]; ma = b[i][j + 1];
			}
			// printf("ma %d mi %d\n", ma, mi);
			if((ma - mi) % w == 0){
				// 縦方向の動く
				for (int k = mi; k <= ma - w; k += w){
					// printf("%d %d \n", k, k + w);
					miti[k].push_back(k + w);
					miti[k + w].push_back(k);
				}
			}else{
				// 横方向に動く
				for (int k = mi; k <= ma - 1; ++k){
					// printf("%d %d\n", k, k + 1);
					miti[k].push_back(k + 1);
					miti[k + 1].push_back(k);
				}
			}
		}
	}

	/*
	rep(i, 20){
		printf("%d : ", i);
		rep(j, miti[i].size()){
			printf("%d ", miti[i][j]);
		}
		printf("\n");
	}
	*/

	rep(i, 1001)rep(j, 1001) memo[i][j] = -1;//初期化
	memo[0][0] = 0;
	queue<pair<int, int> > q;
	q.push(make_pair(0, 0));
	// int cnt = 0;
	while(!q.empty()){
		// cnt++;
		pair<int, int> now = q.front(); q.pop();
		// printf("first %d  second %d\n", now.first, now.second);
		for (int i = 0; i < 4; ++i){
			int nowy = now.first + dy[i], nowx = now.second + dx[i];//座標
			if(0 <= nowy && nowy < h && 0 <= nowx && nowx < w){
				if(memo[nowy][nowx] == -1){//４方向に動いた点はまだたどり着いていない
					int snum = now.first * w + now.second;//始点の座標を数字に変換
					int dnum = nowy      * w + nowx;//目的地の座標を数字に変換
					for(int u : miti[snum]){
						if(u == dnum){//４方向に動いた点は歩くことができた
							memo[nowy][nowx] = memo[now.first][now.second] + 1;
							if(nowy == h - 1 && nowx == w - 1){
								printf("%d\n", memo[nowy][nowx]); return 0;
							}
							q.push(make_pair(nowy, nowx));
						}
					}
				}
			}
		}
	}
	printf("Odekakedekinai..\n");
	return 0;
}