#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <limits>
#include <ctime>
#include <cassert>
#include <map>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <stack>
#include <queue>
#include <numeric>
#include <iterator>
#include <bitset>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
#define ten(x) ((int)1e##x)

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }

ll mod_pow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }

bool memo[50][1<<5][20][20];
bool t[20][20];

int main() {
	int w, h, n; reader(w, h, n);
	int sx, sy; reader(sx, sy);
	sx--; sy--;
	vector<vector<Pii>> bomb;
	FOR(i, n) {
		int l; reader(l);
		bomb.emplace_back();
		FOR(_, l) {
			int x, y; reader(x, y);
			x--; y--;
			bomb.back().emplace_back(x, y);
		}
	}
	memset(t, 1, sizeof(t));
	for (auto& v : bomb) t[v.back().first][v.back().second] = false;

	int sF = 0;
	FOR(i, n) if (bomb[i][0].first != sx || bomb[i][0].second != sy) sF |= (1 << i);
	memo[0][sF][sx][sy] = true;
	FOR(t, 49) {
		FOR(F, 1 << n) FOR(i, w) FOR(j, h) {
			if (F == 0) continue;
			if (!memo[t][F][i][j]) continue;
			int bombtime = 50;
			FOR(x, n) if (F&(1 << x)) bombtime = min(bombtime, sz(bomb[x]) - 1);
			if (t + 1 >= bombtime) continue;
			for (int di = -1; di <= 1; di++) for (int dj = -1; dj <= 1; dj++) {
				int ni = i + di, nj = j + dj;
				if (ni < 0 || ni >= w || nj < 0 || nj >= h) continue;
				if (!::t[ni][nj]) continue;
				int nF = F;
				FOR(x, n) if (F&(1 << x)) {
					if (bomb[x][t + 1].first == ni && bomb[x][t + 1].second == nj) nF ^= (1 << x);
				}
				memo[t + 1][nF][ni][nj] = true;
			}
		}
	}

	int ans = -1;
	FOR(t, 50) {
		FOR(i, w) FOR(j, h) {
			if (ans != -1) break;
			if (memo[t][0][i][j]) ans = t;
		}
	}

	writerLn(ans);

	return 0;
}

Measured memory_bytes: 1568