#include <bits/stdc++.h>

using namespace std;
using PII = pair<int,int>;
using ll = long long;

constexpr int N = 2e6 + 10;

map<array<int,2>,vector<array<int,4>>> q;

int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int dis[110][110];
int vis[110][110];

map<array<int,2>,array<int,3>> pre;

void solve() {
	int n, t;
	cin >> n >> t;
	int x1, y1, x2, y2;
	cin >> x1 >> y1 >> x2 >> y2;
	for(int i = 1; i <= n; i ++) {
		int x, y;
		cin >> x >> y;
		for(int j = 0; j <= 100; j ++) {
			for(int p = 0; p <= 100; p ++) {
				q[{x, j}].push_back({x, p, t, i});
				q[{x, j}].push_back({p, y, t, i});
				q[{j, y}].push_back({x, p, t, i});
				q[{j, y}].push_back({p, y, t, i});
			}
		}
	}
	for(int i = 0; i <= 100; i ++) {
		for(int j = 0; j <= 100; j ++) {
			for(int p = 0; p < 4; p ++) {
				int px = i + dx[p], py = j + dy[p];
				if(px < 0 || py < 0) continue;
				if(px > 100 || py > 100) continue;
				q[{i, j}].push_back({px, py, 1, 0});
			}
		}
	}
	double ans = sqrt(1ll * (x2 - x1) * (x2 - x1) + 1ll * (y2 - y1) * (y2 - y1));
	priority_queue<array<int,3>,vector<array<int,3>>,greater<array<int,3>>> p;
	memset(dis, 0x3f, sizeof dis);
	p.push({0, x1, y1});
	while(p.size()) {
		auto [w1, x1, y1] = p.top();
		p.pop();
		if(vis[x1][y1]) continue;
		vis[x1][y1] = 1;
		for(auto [x2, y2, w2, id] : q[{x1, y1}]) {
			if(dis[x2][y2] > w1 + w2) {
				pre[{x2,y2}] = {x1,y1, id};
				dis[x2][y2] = w1 + w2;
				p.push({w1 + w2, x2, y2});
			}
		}
	}
	double x = dis[x2][y2];
	if(ans < x) {
		cout << ans << "\n";
		cout << 1 << "\n";
		cout << 0 << " " << x2 << " " << y2 << "\n";
	}
	else {
		vector<array<int,3>> k;
		int lx = x2, rx = y2;
		while(lx != x1 || rx != y1) {
			auto [lg, rg, id] = pre[{lx, rx}];
			k.push_back({lx, rx, id});
			lx = lg, rx = rg;
		}
		reverse(k.begin(), k.end());
		cout << x << "\n";
		cout << k.size() << "\n";
		for(auto [x, y, id] : k) {
			cout << id << " " << x << " " << y << "\n";
		}
	}
}

int main() {
	int t;
	t = 1;
	while(t --){
		solve();
	}
}