#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int h,w,n;
int row[1010][1010],col[1010][1010],d[1000010];
vector<int> G[1000010];

void solve(){
  cin >> w >> h >> n;
  rep(i,h*w) d[i]=-1;
  rep(i,n){
    int m;cin >> m;
    int pre_b,b;cin >> pre_b;
    rep(i,m){
      cin >> b;
      if(pre_b/w==b/w){
        if(pre_b<b){
          row[b/w][pre_b%w]+=1;
          row[b/w][b%w]-=1;
        }
        else{
          row[b/w][b%w]+=1;
          row[b/w][pre_b%w]-=1;
        }
      }
      else{
        if(pre_b<b){
          col[pre_b/w][b%w]+=1;
          col[b/w][b%w]-=1;
        }
        else{
          col[b/w][b%w]+=1;
          col[pre_b/w][b%w]-=1;
        }
      }
      pre_b=b;
    }
  }
  rep(i,h){
    rep(j,w-1){
      row[i][j+1]+=row[i][j];
      if(row[i][j]>=1){
        G[i*w+j].push_back(i*w+j+1);
        G[i*w+j+1].push_back(i*w+j);
      }
    }
  }
  rep(i,h-1){
    rep(j,w){
      col[i+1][j]+=col[i][j];
      if(col[i][j]>=1){
        G[i*w+j].push_back((i+1)*w+j);
        G[(i+1)*w+j].push_back(i*w+j);
      }
    }
  }
  queue<int> que;
  que.push(0);d[0]=0;
  while(!que.empty()){
    int s=que.front();que.pop();
    for(int t:G[s]){
      if(d[t]==-1){
        d[t]=d[s]+1;
        que.push(t);
      }
    }
  }
  if(d[h*w-1]==-1) cout << "Odekakedekinai.." << endl;
  else cout << d[h*w-1] << endl;
}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}