// g++-13 1.cpp -std=c++17 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;
 
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

// 距離, どう移動したか, 前の x 座標, 前の y 座標
// que の中では 距離, x, y, -1

struct str{
  double dist;
  int prevx;
  int prevy;
  int type;
};

using T = tuple<double,int,int,int>;

double eps = 1e-5;
double inf = 1e5;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n,t;cin>>n>>t;
  int xh,yh,xe,ye;cin>>xh>>yh>>xe>>ye;

  vector<pair<int,int>> v(n);
  rep(i,0,n){
    int vx,vy;cin>>vx>>vy;
    v[i]={vx,vy};
  }

  vector<vector<str>> ans(110,vector<str>(110,{inf,-1,-1,-1}));

  ans[xh][yh]={0,-1,-1,-1};

  pq_small(T) que;
  que.push({0,xh,yh,-1});

  while(!que.empty()){
    auto [dist,nx,ny,minus]=que.top();
    que.pop();

    if(ans[nx][ny].dist<dist-eps){
      continue;
    }

    rep(i,0,n){
      auto [vx,vy]=v[i];
      if(vx==nx||vy==ny){
        rep(j,0,110){
          // (nx,ny) -> (vx,j)
          if(dist+t+eps<ans[vx][j].dist){
            ans[vx][j]={dist+t,nx,ny,(int)i+1};
            que.push({dist+t,vx,j,-1});
          }

          // (nx,ny) -> (j,vy)
          if(dist+t+eps<ans[j][vy].dist){
            ans[j][vy]={dist+t,nx,ny,(int)i+1};
            que.push({dist+t,j,vy,-1});
          }
        }
      }
    }

    rep(i,0,110){
      rep(j,0,110){
        double nd=(i-nx)*(i-nx)+(j-ny)*(j-ny);
        nd=sqrt(nd);
        if(dist+nd+eps<ans[i][j].dist){
          ans[i][j]={dist+nd,nx,ny,0};
          que.push({dist+nd,i,j,-1});
        }
      }
    }
  }

  cout<<fixed<<setprecision(20);
  cout<<ans[xe][ye].dist<<endl;

  vector<tuple<int,int,int>> route;
  int p=xe,q=ye;
  while(p!=xh||q!=yh){
    route.emplace_back(ans[p][q].type,p,q);
    int np=ans[p][q].prevx,nq=ans[p][q].prevy;
    //cout<<np<<" "<<nq<<endl;
    p=np,q=nq;
    //cout<<" "<<p<<" "<<q<<endl;
  }

  cout<<route.size()<<endl;
  reverse(all(route));
  for(auto [i,j,k]:route)cout<<i<<" "<<j<<" "<<k<<endl;
}