using System;
using System.Collections.Generic;
using System.Linq;

namespace No340_2{
    public class Program{
        public static void Main(string[] args){
            var input = Console.ReadLine().Split(' ');
            var w = int.Parse(input[0]);
            var h = int.Parse(input[1]);
            var n = int.Parse(input[2]);
            var imx = new int[h, w];
            var imy = new int[w, h];

            for(var i = 0; i < n; i++){
                var m = int.Parse(Console.ReadLine());
                var bn = Console.ReadLine().Split(' ').ToList().ConvertAll(int.Parse);
                for(var j = 1; j <= m; j++){
                    var from = Math.Min(bn[j - 1], bn[j]);
                    var to = Math.Max(bn[j - 1], bn[j]);

                    if(to - from < w){
                        var tmp = bn[j] / w;
                        imx[tmp, from - tmp * w]++;
                        imx[tmp, to - tmp * w]--;
                    } else{
                        var tmp = bn[j] % w;
                        imy[tmp, from / w]++;
                        imy[tmp, to / w]--;
                    }
                }
            }

            for(var i = 0; i < h; i++){
                for(var j = 1; j < w; j++){
                    imx[i, j] += imx[i, j - 1];
                }
            }

            for(var i = 0; i < w; i++){
                for(var j = 1; j < h; j++){
                    imy[i, j] += imy[i, j - 1];
                }
            }

            var result = new int[w * h];
            result[0] = 1;
            var que = new Queue<int>();

            if(imx[0, 0] != 0){
                que.Enqueue(1);
                result[1] = 2;
            }
            if(imy[0, 0] != 0) {
                que.Enqueue(w);
                result[w] = 2;
            }

            while(que.Count > 0 && result[w * h - 1] == 0){
                var cur = que.Dequeue();
                {
                    var tmp = cur / w;
                    if(tmp == (cur - 1) / w && imx[tmp, cur - tmp * w - 1] != 0 && result[cur - 1] == 0){
                        que.Enqueue(cur - 1);
                        result[cur - 1] = result[cur] + 1;
                    }
                    if(tmp == (cur + 1) / w && imx[tmp, cur - tmp * w] != 0 && result[cur + 1] == 0){
                        que.Enqueue(cur + 1);
                        result[cur + 1] = result[cur] + 1;
                    }
                }
                {
                    var tmp = cur % w;
                    if(cur - w > 0 && imy[tmp, cur / w - 1] != 0 && result[cur - w] == 0){
                        que.Enqueue(cur - w);
                        result[cur - w] = result[cur] + 1;
                    }
                    if(cur + w < w * h && imy[tmp, cur / w] != 0 && result[cur + w] == 0){
                        que.Enqueue(cur + w);
                        result[cur + w] = result[cur] + 1;
                    }
                }
            }

            if(result[w * h - 1] == 0)
                Console.WriteLine("Odekakedekinai..");
            else
                Console.WriteLine(result[w * h - 1] - 1);
        }
    }
}