local mfl, mce = math.floor, math.ceil local w, h, nq = io.read("*n", "*n", "*n") local rows = {} for i = 1, h do rows[i] = {} for j = 1, w do rows[i][j] = 0 end end local cols = {} for i = 1, w do cols[i] = {} for j = 1, h do cols[i][j] = 0 end end local function getrowcol(idx) local c = idx % w + 1 local r = mfl(idx / w) + 1 return r, c end for i = 1, nq do local m = io.read("*n") local src = io.read("*n") local src_row, src_col = getrowcol(src) for j = 1, m do local dst = io.read("*n") local dst_row, dst_col = getrowcol(dst) if src_row == dst_row then if src_col < dst_col then rows[src_row][src_col] = rows[src_row][src_col] + 1 rows[src_row][dst_col] = rows[src_row][dst_col] - 1 else rows[src_row][src_col] = rows[src_row][src_col] - 1 rows[src_row][dst_col] = rows[src_row][dst_col] + 1 end else if src_row < dst_row then cols[src_col][src_row] = cols[src_col][src_row] + 1 cols[src_col][dst_row] = cols[src_col][dst_row] - 1 else cols[src_col][src_row] = cols[src_col][src_row] - 1 cols[src_col][dst_row] = cols[src_col][dst_row] + 1 end end src_row, src_col = dst_row, dst_col end end for i = 1, h do for j = 2, w do rows[i][j] = rows[i][j] + rows[i][j - 1] end end for i = 1, w do for j = 2, h do cols[i][j] = cols[i][j] + cols[i][j - 1] end end local inf = 1000000007 local len = {} local taskstate = {} for i = 1, h * w do taskstate[i] = false len[i] = inf end len[1] = 0 local tasks = {} local tasknum = 0 local done = 0 local tasklim = h * w local function addtask(idx) if not taskstate[idx] then taskstate[idx] = true tasknum = tasknum + 1 local taskidx = tasknum % tasklim if taskidx == 0 then taskidx = tasklim end tasks[taskidx] = idx end end local function walk(src, dst) if len[src] + 1 < len[dst] then len[dst] = len[src] + 1 addtask(dst) end end addtask(1) while done < tasknum do done = done + 1 local taskidx = done % tasklim if taskidx == 0 then taskidx = tasklim end local idx = tasks[taskidx] taskstate[idx] = false local r, c = getrowcol(idx - 1) if w < idx and 0 < cols[c][r - 1] then walk(idx, idx - w) end if idx <= (h - 1) * w and 0 < cols[c][r] then walk(idx, idx + w) end if 1 < w then if idx % w ~= 0 and 0 < rows[r][c] then walk(idx, idx + 1) end if idx % w ~= 1 and 0 < rows[r][c - 1] then walk(idx, idx - 1) end end end print(inf <= len[h * w] and "Odekakedekinai.." or len[h * w])