// #include <atcoder/all>
// using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define popcnt(x) __builtin_popcount(x)
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<ll>>;
const int inf = 1e9;
const ll lim = 1e18;
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};

// const int mod = 1000000007;
const int mod = 998244353;
struct mint {
  ll x;  // typedef long long ll;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int h, w, n;
  cin >> w >> h >> n;
  vvi row(h, vi(w, 0));
  vvi col(w, vi(h, 0));

  rep(_, n) {
    int m;
    cin >> m;
    vi b(m + 1);
    rep(i, m + 1) cin >> b[i];
    rep(k, m) {
      int i = b[k] / w, j = b[k] % w, s = b[k + 1] / w, t = b[k + 1] % w;
      if (i == s) {
        if (j > t) swap(j, t);
        row[i][j]++;
        row[s][t]--;
      } else {
        if (i > s) swap(i, s);
        col[j][i]++;
        col[t][s]--;
      }
    }
  }

  rep(i, h) rep(j, w - 1) row[i][j + 1] += row[i][j];
  rep(j, w) rep(i, h - 1) col[j][i + 1] += col[j][i];

  deque<pii> q;
  vvi dist(h, vi(w, -1));
  q.emplace_back(0, 0);
  dist[0][0] = 0;

  auto update = [&](int i, int j, int d) {
    dist[i][j] = d;
    q.emplace_back(i, j);
  };

  while (!q.empty()) {
    auto [i, j] = q.front();
    q.pop_front();
    int d = dist[i][j] + 1;
    if (j && row[i][j - 1] && dist[i][j - 1] == -1) update(i, j - 1, d);
    if (j + 1 < w && row[i][j] && dist[i][j + 1] == -1) update(i, j + 1, d);
    if (i && col[j][i - 1] && dist[i - 1][j] == -1) update(i - 1, j, d);
    if (i + 1 < h && col[j][i] && dist[i + 1][j] == -1) update(i + 1, j, d);
  }

  if (dist[h - 1][w - 1] == -1)
    cout << "Odekakedekinai.." << endl;
  else
    cout << dist[h - 1][w - 1] << endl;

  return 0;
}