#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }

/*
 <url:https://yukicoder.me/problems/no/340>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
int coord2idx(const pii& coor,const int H,const int W){
    return coor.first*W + coor.second;
}
pii idx2coord(const int idx,const int H,const int W){
    return make_pair(idx/W, idx%W);
}

vector<int> G[1000010];
int dist[1000010];
string solve(){
    string res;
    int W,H,N; cin >> W >> H >> N;
    for(int _ = 0; _ < N; _++){
        int M; cin >> M;
        vector<int> B(M+1);
        for(auto& in:B) cin >> in;
        for(int i = 0; i < M; i++){
            int S = B[i],T = B[i+1];
            
            pii sc = idx2coord(S, H, W),tc = idx2coord(T, H, W);
            int d = -1;
            if(sc.first == tc.first){ // 縦方向移動
                if(sc.second < tc.second){ // 下方向
                    d = 1;
                }else{
                    d = 3;
                }
            }
            if(sc.second == tc.second){ // 横方向移動
                if(sc.first < tc.first){
                    d = 0;
                }else{
                    d = 2;
                }
            }
            
            int now = S;
            pii n = sc;
            while(now != T){
                n = make_pair(n.first + dx[d], n.second + dy[d]);
                int next = coord2idx(n, H, W);
                G[now].push_back(next);
                G[next].push_back(now);
                
                now = next;
            }
        }
    }
    for(int i = 0; i < H*W; i++){
        sort(G[i].begin(),G[i].end());
        G[i].erase(unique(G[i].begin(),G[i].end()),G[i].end());
    }
    
    fill(dist,dist+1000010,INF);
    dist[0] = 0;
    queue<int> q; q.push(0);
    while(q.size()){
        int n = q.front(); q.pop();
        for(auto next:G[n]){
            if(dist[next] > dist[n] + 1){
                dist[next] = dist[n] + 1;
                q.push(next);
            }
        }
    }
    if(dist[H*W-1] == INF) return "Odekakedekinai..";
    res = to_string(dist[H*W-1]);
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    cout << solve() << endl;
    return 0;
}