#include<bits/stdc++.h>
using namespace std;

const int MAXN = 101, MAXV = 202;
int n,t,xh,yh,xe,ye;
double dist[MAXV][MAXV];
pair<int,int> pre[MAXV][MAXV];
priority_queue<pair<double,pair<int,int>>> nod;
vector<array<int,3>> grafo[MAXV][MAXV];
bool ok[MAXV][MAXV];
int id[MAXV][MAXV];

void dj(int x,int y){
    if(ok[x][y])return;
    ok[x][y]=true;
    
    for(auto [tox,toy,cost] : grafo[x][y]){
        if(dist[tox][toy]<-0.5 || dist[tox][toy]>dist[x][y]+cost){
            dist[tox][toy]=dist[x][y]+cost;
            pre[tox][toy]={x,y};
            nod.push({-dist[tox][toy],{tox,toy}});
        }
    }
    
    if(x>=MAXN || y>=MAXN)return;
    
    for(int i=0;i<MAXN;i++){
        for(int j=0;j<MAXN;j++){
            double cost = sqrt((x-i)*(x-i)+(y-j)*(y-j));
            
            if(dist[i][j]<-0.5 || dist[i][j]>dist[x][y]+cost){
                dist[i][j]=dist[x][y]+cost;
                pre[i][j]={x,y};
                nod.push({-dist[i][j],{i,j}});
            }
        }
    }
}

void solve(){
    for(int i=0;i<MAXV;i++){
        for(int j=0;j<MAXV;j++){
            dist[i][j]=-1.0;
        }
    }
    
    cin>>n>>t>>xh>>yh>>xe>>ye;
    
    for(int i=0;i<n;i++){
        int x,y;
        cin>>x>>y;
        id[MAXN+x][MAXN+y]=i+1;
        for(int j=0;j<MAXN;j++){
            grafo[j][y].push_back({MAXN+x,MAXN+y,t});
            grafo[MAXN+x][MAXN+y].push_back({j,y,0});
        }
        
        for(int j=0;j<MAXN;j++){
            grafo[x][j].push_back({MAXN+x,MAXN+y,t});
            grafo[MAXN+x][MAXN+y].push_back({x,j,0});
        }
    }
    
    dist[xe][ye]=0;
    nod.push({0,{xe,ye}});
   
    while(!nod.empty()){
        auto [x,y] = nod.top();
        nod.pop();
        dj(y.first,y.second);
    }
    
    cout<<setprecision(20)<<dist[xh][yh]<<"\n";
    int x=xh,y=yh;
    
    vector<array<int,3>> sol;
    while(x!=xe || y!=ye){
        auto [sx,sy] = pre[x][y];
        if(sx<MAXN){
            if(x<MAXN)
            sol.push_back({0,sx,sy});
            else
            sol.push_back({id[x][y],sx,sy});
        }
        x=sx;
        y=sy;
    }
    
    cout<<sol.size()<<"\n";
    for(auto [x,y,z] : sol)cout<<x<<" "<<y<<" "<<z<<"\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++)solve();
    
    return 0;
}