#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
#define _(_1,_2,_3,N,...)N
#define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__)
template<C T>void pr1(T a){cout<<a;ln;}
template<C T,C T2>void pr2(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr3(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

int a[1100][1100][4];

void Main() {
  int n,m,k;
  cin >> m >> n >> k;
  rep(i,k) {
    int l,xx=-1,yy=-1;
    cin >> l;
    rep(j,l+1) {
      int z;
      cin >> z;
      int x=z/m,y=z%m;
      if(xx!=-1) {
        if(xx==x&&yy<y) {
          a[xx][yy][1]++,a[x][y][1]--;
          a[x][y][3]++,a[xx][yy][3]--;
        } else if(xx==x&&yy>y) {
          a[x][y][1]++,a[xx][yy][1]--;
          a[xx][yy][3]++,a[x][y][3]--;
        } else if(xx<x&&yy==y) {
          a[xx][yy][2]++,a[x][y][2]--;
          a[x][y][0]++,a[xx][yy][0]--;
        } else {
          a[x][y][2]++,a[xx][yy][2]--;
          a[xx][yy][0]++,a[x][y][0]--;
        }
      }
      xx=x,yy=y;
    }
  }
  rep(i,n) {
    REP(j,1,m) a[i][j][1]+=a[i][j-1][1];
    rrep(j,m-1) a[i][j][3]+=a[i][j+1][3];
  }
  rep(j,m) {
    REP(i,1,n) a[i][j][2]+=a[i-1][j][2];
    rrep(i,n-1) a[i][j][0]+=a[i+1][j][0];
  }
  int d[n][m];
  rep(i,n)rep(j,m)d[i][j]=MAX;
  d[0][0]=0;
  queue<P> que;
  que.push(P(0,0));
  while(!que.empty()) {
    P p=que.front();que.pop();
    int nx=p.F,ny=p.S;
    rep(i,4) {
      if(!a[nx][ny][i]) continue;
      int x=nx+dx[i],y=ny+dy[i];
      if(d[x][y]<=d[nx][ny]+1) continue;
      d[x][y]=d[nx][ny]+1;
      que.push(P(x,y));
    }
  }
  if(d[n-1][m-1]==MAX) pr("Odekakedekinai..");
  else pr(d[n-1][m-1]);
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  Main();return 0;
}