import std.conv, std.functional, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } int H, W, N; int[] M; int[][] B; void main() { try { for (; ; ) { W = readInt(); H = readInt(); N = readInt(); M = new int[N]; B = new int[][N]; foreach (i; 0 .. N) { M[i] = readInt(); B[i] = new int[M[i] + 1]; foreach (j; 0 .. M[i] + 1) { B[i][j] = readInt(); } } auto road = new int[][](H * 2, W * 2); foreach (i; 0 .. N) { foreach (j; 0 .. M[i]) { int xa = B[i][j] / W; int ya = B[i][j] % W; int xb = B[i][j + 1] / W; int yb = B[i][j + 1] % W; if (xa > xb) { swap(xa, xb); } if (ya > yb) { swap(ya, yb); } ++road[xa * 2][ya * 2]; --road[xa * 2][yb * 2 + 1]; --road[xb * 2 + 1][ya * 2]; ++road[xb * 2 + 1][yb * 2 + 1]; } } foreach (x; 1 .. H * 2) foreach (y; 0 .. W * 2) { road[x][y] += road[x - 1][y]; } foreach (x; 0 .. H * 2) foreach (y; 1 .. W * 2) { road[x][y] += road[x][y - 1]; } debug { foreach_reverse (x; 0 .. H * 2) { writeln(road[x]); } } auto q = new int[H * W]; int qHead, qTail; auto dist = new int[H * W]; dist[] = -1; dist[0] = 0; q[qTail++] = 0; for (; qHead < qTail; ) { const u = q[qHead]; ++qHead; const x = u / W; const y = u % W; /* foreach (dir; 0 .. 4) { const xx = x + [+1, 0, -1, 0][dir]; const yy = y + [0, +1, 0, -1][dir]; if (0 <= xx && xx < H && 0 <= yy && yy < W) { if (road[x + xx][y + yy] > 0) { const v = xx * W + yy; if (dist[v] == -1) { dist[v] = dist[u] + 1; q[qTail++] = v; } } } } */ if (x + 1 < H && road[x + x + 1][y + y] > 0) { const v = u + W; if (dist[v] == -1) { dist[v] = dist[u] + 1; q[qTail++] = v; } } if (y + 1 < W && road[x + x][y + y + 1] > 0) { const v = u + 1; if (dist[v] == -1) { dist[v] = dist[u] + 1; q[qTail++] = v; } } if (x - 1 >= 0 && road[x + x - 1][y + y] > 0) { const v = u - W; if (dist[v] == -1) { dist[v] = dist[u] + 1; q[qTail++] = v; } } if (y - 1 >= 0 && road[x + x][y + y - 1] > 0) { const v = u - 1; if (dist[v] == -1) { dist[v] = dist[u] + 1; q[qTail++] = v; } } } if (dist[H * W - 1] == -1) { writeln("Odekakedekinai.."); } else { writeln(dist[H * W - 1]); } } } catch (EOFException e) { } }