#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll int
#define fr first
#define sc second
#define pb push_back
#define ARRS ((ll)(2e6 + 100))
#define MOD ((ll)998244353)
#define MAX ((ll)(1e9 + 100))
#define EP ((double)(1e-9))


vector<ll> X[ARRS];
vector<ll> Y[ARRS];
ll x[ARRS],y[ARRS];


struct St {
	ll cost;
	ll x;
	ll y;
	ll px;
	ll py;
	ll method;
	bool operator<(St o) const { return ((array<ll, 6>){cost, x, y, px, py, method}) < ((array<ll, 6>){o.cost, o.x, o.y, o.px, o.py, o.method}); }
};

St best[110][110];
ll f[110][110];


int main() {
	ll n,T;
	cin>>n>>T;
	ll xs, ys, xe, ye;
	cin>>xs>>ys;
	cin>>xe>>ye;
	for(int i=0; i<n; i++){
		cin>>x[i]>>y[i];
		X[x[i]].pb(i);
		Y[y[i]].pb(i);
	}
	set<St> s;
	St b;
	b.cost = 0;
	b.x = xs;
	b.y = ys;
	b.method = -1;
	double de = sqrt((xs-xe)*(xs-xe)+(ys-ye)*(ys-ye));

	s.insert(b);
	ll dx[4] = {0, 0, 1, -1};
	ll dy[4] = {1, -1, 0, 0};

	for(int i=0;i<=100; i++)
		for(int j=0;j<=100; j++)
			best[i][j].cost = ((int)de)+10;

	while(!s.empty()){
		St cur = *s.begin();
		s.erase(s.begin());
		if(f[cur.x][cur.y])continue;
		f[cur.x][cur.y] = 1;
		best[cur.x][cur.y] =cur;
		if(cur.x == xe && cur.y == ye)  {
			break;
		}
		St n;
		n.px = cur.x;
		n.py = cur.y;
		for(int di=0; di<4; di++){
			n.x = cur.x + dx[di];
			n.y = cur.y + dy[di];
			n.method = 0;
			n.cost = cur.cost + 1;
			if(0>n.x || n.x > 100)continue;
			if(0>n.y || n.y > 100)continue;
			if(!f[n.x][n.y] && best[n.x][n.y].cost > n.cost)
				s.insert(n);
		}
		for(auto i:X[cur.x]){
			for(int nx=0; nx<=100; nx++){
				n.x = nx;
				n.y = y[i];
				n.method = i+1;
				n.cost = cur.cost+T;
			if(!f[n.x][n.y] && best[n.x][n.y].cost > n.cost)
				s.insert(n);
			}
			for(int ny=0; ny<=100; ny++){
				n.x = x[i];
				n.y = ny;
				n.method = i+1;
				n.cost = cur.cost+T;
			if(!f[n.x][n.y] && best[n.x][n.y].cost > n.cost)
				s.insert(n);
			}
		}
		for(auto i:Y[cur.y]){
			for(int nx=0; nx<=100; nx++){
				n.x = nx;
				n.y = y[i];
				n.method = i+1;
				n.cost = cur.cost+T;
			if(!f[n.x][n.y] && best[n.x][n.y].cost > n.cost)
				s.insert(n);
			}
			for(int ny=0; ny<=100; ny++){
				n.x = x[i];
				n.y = ny;
				n.method = i+1;
				n.cost = cur.cost+T;
			if(!f[n.x][n.y] && best[n.x][n.y].cost > n.cost)
				s.insert(n);
			}
		}
	}
	if(de < (best[xe][ye].cost)) {
		printf("%.5f\n", de);
		cout<<1<<endl;
		cout<<0<<" "<<xe<<" "<<ye<<endl;
	} else {
		cout<<best[xe][ye].cost<<endl;
		vector<St> path;
		St cur = best[xe][ye];
		while(cur.method != -1){
			path.pb(cur);
			cur = best[cur.px][cur.py];
		}
		reverse(path.begin(), path.end());
		cout<<path.size()<<endl;
		for(auto cur: path){
			cout<<cur.method<<" "<<cur.x<<" "<<cur.y<<endl;
		}
	}
	return 0;
}