#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;

int w, h, n, m, b1, b2;
si E[1000000], st, stn;
bool y[1000000];
void draw(int s, int t){
  if(s > t)swap(s, t);
  int d;
  d = ((t - s) % w == 0 ? w : 1);
  while(t > s){
    E[s].insert(s + d);
    E[s+d].insert(s);
    s += d;
  }
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> w >> h >> n;
  FOR(i, 0, n){
    cin >> m >> b2;
    FOR(j, 0, m){
      cin >> b1;
      draw(b1, b2);
      swap(b1, b2);
    }
  }
  y[0] = true;
  st.insert(0);
  int ans = 0;
  while(!st.empty()){
    each(itr, st){
      if(*itr == h * w - 1){
        cout << ans << endl;
        return 0;
      }
      each(itr2, E[*itr]){
        if(!y[*itr2]){
          y[*itr2] = true;
          stn.insert(*itr2);
        }
      }
    }
    swap(st, stn);
    stn.clear();
    ans++;
  }
  cout << "Odekakedekinai.." << endl;
  return 0;
}