#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;

inline bool cheak(ll x, ll y, ll xMax, ll yMax) { return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toint(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string tostring(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
template<class T> inline T mypow(T x, ll n) { T res = 1; while (n > 0) { if (n & 1)res = res * x;	x = x * x;	n >>= 1; }return res; }
inline int gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline int lcm(ll a, ll b) { return a / gcd(a, b) * b; }

#define For(i,a,b)	for(ll (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define rFor(i,a,b)	for(ll (i) = (a-1);i >= (b);(i)--)
#define rrep(i,n)	rFor(i,n,0)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define sz(a)		(sizeof(a))
#define tostr(a)	tostring(a)
#define dump(val) 	cerr << #val " = " << val << endl;
#define Fill(a,v)	fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)

const ll dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };

const ll mod = 1e9 + 7;
const ll INF = 1e17 + 9;

#define int ll

int d[1001 * 1001];

signed main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	Fill(d, INF);
	map<int, P> table;
	map<P, int> table2;
	int w, h, n;
	cin >> w >> h >> n;
	rep(x, w)rep(y, h) {
		table[x * h + y] = P(x, y);
		table2[P(x, y)] = x * h + y;
	}

	map<int, set<int>> ok;
	rep(i, n) {
		int m;
		cin >> m;
		vector<int> t;
		int start;
		cin >> start;
		rep(j, m) {
			int next;
			cin >> next;
			int sx = table[start].first, sy = table[start].second;
			int tx = table[next].first, ty = table[next].second;
			if (sx == tx) {
				if (sy < ty) {
					for (int y = sy; y <= ty; y++) {
						t.push_back(table2[P(sx, y)]);
					}
				}
				else {
					for (int y = sy; y >= ty; y--) {
						t.push_back(table2[P(sx, y)]);
					}
				}
			}
			if (sy == ty) {
				if (sx < tx) {
					for (int x = sx; x <= tx; x++) {
						t.push_back(table2[P(x, sy)]);
					}
				}
				else {
					for (int x = sx; x >= tx; x--) {
						t.push_back(table2[P(x, sy)]);
					}
				}
			}
			start = next;
		}

		int now = t[0];
		For(j, 1, t.size()) {
			int next = t[j];
			ok[now].insert(next);
			ok[next].insert(now);
			now = next;
		}
	}

	priority_queue<P, vector<P>, greater<P>> q;
	q.push(P(0, 0));
	d[0] = 0;
	while (q.size()) {
		auto p = q.top(); q.pop();
		int v = p.second;
		if (d[v] < p.first)continue;
		for (auto i : ok[v]) {
			if (d[i] > d[v] + 1) {
				d[i] = d[v] + 1;
				q.push(P(d[i], i));
			}
		}
	}
	int ans = d[w * h - 1];
	if (ans == INF) {
		cout << "Odekakedekinai.." << endl;
	}
	else {
		cout << ans << endl;
	}
	return 0;
}