package no340; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; import java.util.NoSuchElementException; public class Main { public static final int INF = 1 << 29; public static void main(String[] args) { IO io = new IO(); int w = io.nextInt(); int h = io.nextInt(); int n = io.nextInt(); int[][] vert = new int[h-1][w]; int[][] hori = new int[h][w-1]; for(int i=0;i> 32); if (ci < h - 1 && vert[ci][cj] >= 1) check(q, dist, w, ci+1, cj, cd + 1); if (ci >= 1 && vert[ci-1][cj] >= 1) check(q, dist, w, ci-1, cj, cd + 1); if (cj < w - 1 && hori[ci][cj] >= 1) check(q, dist, w, ci, cj+1, cd + 1); if (cj >= 1 && hori[ci][cj-1] >= 1) check(q, dist, w, ci, cj-1, cd + 1); } if (dist[h-1][w-1] >= INF) { System.out.println("Odekakedekinai.."); }else{ System.out.println(dist[h-1][w-1]); } } public static void check(MyQueueLong q,int[][] dist,int w, int ni,int nj,int nd) { if (dist[ni][nj] > nd) { dist[ni][nj] = nd; q.offer((ni * w + nj) | ((long) nd << 32)); } } } class MyQueueLong { int n; long[] data; int begin = 0; int size = 0; public MyQueueLong(int buffersize) { n = buffersize; data = new long[n]; } public int size() { return size; } public boolean isEmpty() { return size == 0; } public void offer(long x) { if (size == n) { throw new RuntimeException(); } int i = begin + size; if (i >= n) i -= n; data[i] = x; size++; } public long poll() { if (size == 0) { throw new RuntimeException(); } long ret = data[begin]; begin++; if (begin >= n) begin = 0; size--; return ret; } } class IO extends PrintWriter { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public IO() { this(System.in);} public IO(InputStream source) { super(System.out); this.in = source;} private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private static boolean isNewLine(int c) { return c == '\n' || c == '\r';} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();} public String next() { if (!hasNext()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public char[] nextCharArray(int len) { if (!hasNext()) { throw new NoSuchElementException(); } char[] s = new char[len]; int i = 0; int b = readByte(); while(isPrintableChar(b)) { if (i == len) { throw new InputMismatchException(); } s[i++] = (char) b; b = readByte(); } return s; } public String nextLine() { if (!hasNextLine()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(!isNewLine(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) { throw new NoSuchElementException(); } long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) { throw new NumberFormatException(); } return (int) nl; } public char nextChar() { if (!hasNext()) { throw new NoSuchElementException(); } return (char) readByte(); } public double nextDouble() { return Double.parseDouble(next());} public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i