#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

W, H, Q = map(int, readline().split())
query = readlines()

if H == W == 1:
    print(0)
    exit()

N = H * W
horizonal_max = list(range(N))
vertical_max = list(range(N))

for line in query[1::2]:
    B = map(int, line.split())
    x = next(B)
    for y in B:
        a, b = x, y
        if a > b:
            a, b = b, a
        if b - a < W:
            if horizonal_max[a] < b:
                horizonal_max[a] = b
        else:
            if vertical_max[a] < b:
                vertical_max[a] = b
        x = y

go_left = [False] * N
go_right = [False] * N
go_up = [False] * N
go_down = [False] * N
for i in range(N):
    h = horizonal_max[i]
    if h > i:
        if horizonal_max[i + 1] < h:
            horizonal_max[i + 1] = h
        go_right[i] = True
        go_left[i + 1] = True
    v = vertical_max[i]
    if v > i:
        if vertical_max[i + W] < v:
            vertical_max[i + W] = v
        go_up[i] = True
        go_down[i + W] = True

INF = N + 10
dist = [INF] * N
visited = [False] * N
q = [0]
goal = N - 1
d = 0
while q:
    qq = []
    d += 1
    for v in q:
        if go_right[v] and not visited[v + 1]:
            visited[v + 1] = True
            qq.append(v + 1)
        if go_left[v] and not visited[v - 1]:
            visited[v - 1] = True
            qq.append(v - 1)
        if go_up[v] and not visited[v + W]:
            visited[v + W] = True
            qq.append(v + W)
        if go_down[v] and not visited[v - W]:
            visited[v - W] = True
            qq.append(v - W)
    if visited[goal]:
        print(d)
        exit()
    q = qq

print('Odekakedekinai..')