#include <iostream>
#include <vector>
#include <queue>

using namespace std;

int main() {
    int W, H, N;
    cin >> W >> H >> N;
    int size = W * H;
    vector<vector<int>> adj(size);
    for (int i = 0; i < N; ++i) {
        int M;
        cin >> M;
        M += 1;
        vector<int> B(M);
        for (int j = 0; j < M; ++j) {
            cin >> B[j];
        }
        for (int j = 0; j < M-1; ++j) {
            int a = B[j];
            int b = B[j+1];
            int x1 = a % W;
            int y1 = a / W;
            int x2 = b % W;
            int y2 = b / W;
            if (x1 == x2) {
                int start_y = min(y1, y2);
                int end_y = max(y1, y2);
                for (int y = start_y; y < end_y; ++y) {
                    int u = x1 + y * W;
                    int v = x1 + (y + 1) * W;
                    adj[u].push_back(v);
                    adj[v].push_back(u);
                }
            } else {
                int start_x = min(x1, x2);
                int end_x = max(x1, x2);
                for (int x = start_x; x < end_x; ++x) {
                    int u = x + y1 * W;
                    int v = (x + 1) + y1 * W;
                    adj[u].push_back(v);
                    adj[v].push_back(u);
                }
            }
        }
    }
    vector<int> dist(size, -1);
    queue<int> q;
    q.push(0);
    dist[0] = 0;
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        if (u == W * H - 1) break;
        for (int v : adj[u]) {
            if (dist[v] == -1) {
                dist[v] = dist[u] + 1;
                q.push(v);
            }
        }
    }
    if (dist[W * H - 1] == -1) {
        cout << "Odekakedekinai.." << endl;
    } else {
        cout << dist[W * H - 1] << endl;
    }
    return 0;
}