#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector veci; typedef vector vecs; template using Hash=unordered_map; #define REP(i, a, n) for(ll i = a; i < n; i++) #define RREP(i, a, n) for(ll i = n-1; i >= a; i--) #define rep(i, n) REP(i, 0, n) #define rrep(i, n) RREP(i, 0, n) #define MD 1000000007 template T read(){T a;cin >> a;return a;} template void read(T& a){cin >> a;} template void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}} template void write(T a){cout << a << endl;} template void writes(vector a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;} void write(double a){cout << fixed << setprecision(12) << a << endl;} void write(long double a){cout << fixed << setprecision(12) << a << endl;} template void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;} void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}} void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}} ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}} ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;} int h,w,n; int dx[]={1,0,-1,0}; int dy[]={0,1,0,-1}; int res[1000][1000]={0}; bool b[1000][1000][4]={0}; int xh[1000][1000]={0}; int yh[1000][1000]={0}; typedef pair Vec; Vec sp(int num){ int x=num%w; int y=num/w; Vec p; p.first=x;p.second=h-y-1; return p; } int main(void) { cin>>h>>w>>n; rep(i,h)rep(j,w)res[i][j]=-1; rep(i,n){ int m=read(); Vec bef=sp(read()); rep(j,m){ Vec p=sp(read()); if(p.second==bef.second){ int x1=p.first; int x2=bef.first; if(x1>x2)swap(x1,x2); xh[p.second][x1]=max(xh[p.second][x1],x2); } else{ int y1=p.second; int y2=bef.second; if(y1>y2)swap(y1,y2); yh[p.first][y1]=max(yh[p.second][y1],y2); } bef=p; } } rep(i,h){ int j=0; while(j q; q.push(Vec(sx,sy)); res[sy][sx]=0; while(!q.empty()){ Vec top=q.front(); int x=top.first; int y=top.second; q.pop(); rep(i,4){ if(!b[y][x][i])continue; int cx=x+dx[i]; int cy=y+dy[i]; if(res[cy][cx]>-1)continue; res[cy][cx]=res[y][x]+1; q.push(Vec(cx,cy)); } } if(res[0][w-1]!=-1) write(res[0][w-1]); else write("Odekakedekinai.."); return 0; }