#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
//---------------------------------------------------------------------------------------------------
#define INF INT_MAX/2
template<class T> struct SectionStructureOr {
    set<pair<T, T>> buf;
    SectionStructureOr() { buf.insert({ -INF, -INF }); buf.insert({ INF , INF }); }
    void add(T l, T r) { auto ite = buf.lower_bound({ l, -INF });
        if (ite->first == INF) { ite--; if (ite->second <= l) buf.insert({ l, r });
            else { T L = ite->first, R = ite->second; buf.erase(ite); buf.insert({ L, max(r, R) }); }
        } else { auto pre = buf.upper_bound({ r, -INF }); auto pp = pre; pp--;
            T L = min(l, ite->first), R = max(r, pp->second); buf.erase(ite, pre); buf.insert({ L, R }); }}
    auto get(T x) { auto ite = buf.lower_bound({ x, -INF });
        if (ite->first == INF) return buf.end(); if (ite->second < x) return buf.end(); return ite; }
    auto end() { return buf.end(); }
    bool checkSameGroup(T a, T b) { if (a > b) swap(a, b);
        auto aa = buf.upper_bound({ a, INF }); aa--; if (aa->first == -INF) return false;
        return b <= aa->second; }
    void print() { printf("<>\n"); for (auto p : buf) cout << "[" << p.first << "," << p.second << "]\n"; }
};
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧  
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     
　　　　／　　　＼　 　　|　|     
　　　 /　　 /￣￣￣￣/　　|  
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿  
　 　　　＼/＿＿＿＿/　（u　⊃  
---------------------------------------------------------------------------------------------------*/









int W, H, N;
int M[1010];
int B[1010][1010];
SectionStructureOr<int> vec[1010];
SectionStructureOr<int> hor[1010];
//-----------------------------------------------------------------
void makeEdge() {
    rep(i, 0, N) {
        rep(j, 0, M[i]) {
            int a = B[i][j];
            int b = B[i][j + 1];

            if (a > b) swap(a, b);

            int ya = a / W; int xa = a % W;
            int yb = b / W; int xb = b % W;

            if (ya == yb) { // x軸での移動
                hor[ya].add(xa, xb);
            }
            else { // y軸での移動
                vec[xa].add(ya, yb);
            }
        }
    }
}
//-----------------------------------------------------------------
bool done[1010][1010];
int dist[1010][1010];
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { -1, 0, 1, 0 };
int bfs() {
    queue<int> que;
    done[0][0] = true;
    dist[0][0] = 0;
    que.push(0);

    while (!que.empty()) {
        int y = que.front() / 1010;
        int x = que.front() % 1010;
        que.pop();

        if (y == H - 1 && x == W - 1) return dist[y][x];

        rep(i, 0, 4) {
            int xx = x + dx[i];
            int yy = y + dy[i];
            if (xx < 0 || W <= xx) continue;
            if (yy < 0 || H <= yy) continue;

            if (i % 2 == 1) {
                if (!hor[y].checkSameGroup(x, xx)) continue;
            }
            else {
                if (!vec[x].checkSameGroup(y, yy)) continue;
            }

            if (done[yy][xx]) continue;

            done[yy][xx] = 1;
            dist[yy][xx] = dist[y][x] + 1;
            que.push(yy * 1010 + xx);
        }
    }

    return -1;
}
//-----------------------------------------------------------------
void _main() {
    cin >> W >> H >> N;
    rep(i, 0, N) {
        cin >> M[i];
        rep(j, 0, M[i] + 1) cin >> B[i][j];
    }

    makeEdge();

    int ans = bfs();
    if (0 <= ans)
        cout << ans << endl;
    else
        cout << "Odekakedekinai.." << endl;
}