#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = numeric_limits<int>::max();
vector< vector< pair<int, int> > > holes;
vector< vector< vector< int > > > memo;
pair<int, int> start;
pair<int, int> ende;
int dist(int a, int b, int c, int d){
return abs(a-c)+abs(b-d);
}
int dp(int floor, int x, int y){
//cout << floor << ' ' << x << ' ' << y << endl;
if(floor == 1){
return dist(x,y,ende.first, ende.second);
}
if(memo[floor][x][y] != -1) return memo[floor][x][y];
memo[floor][x][y] = INF;
for(int i = 0; i < (int)holes[floor].size(); i++){
pair<int, int> p = holes[floor][i];
memo[floor][x][y] = min(memo[floor][x][y], dp(floor-1, p.first, p.second) + dist(p.first, p.second, x, y));
}
return memo[floor][x][y];
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int m, k;
cin >> k >> m;
cin >> start.first >> start.second;
cin >> ende.first >> ende.second;
holes.resize(k+1);
for(int i = k; i > 1; i--){
int q;
cin >> q;
for(int j = 0; j < q; j++){
pair<int, int> p;
cin >> p.first >> p.second;
holes[i].push_back(p);
}
}
memo.resize(k+1, vector< vector< int > >(51, vector< int > (51,-1)));
cout << dp(k, start.first, start.second) << endl;
}
