#include <bits/stdc++.h>
#ifdef LOCAL
#include "cp_debug.h"
#else
#define debug(...) 42
#endif
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<string, int> Op;

template<typename T> void read(T &x){
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) {
    read(first);
    read(args...);
}
template<typename T> void write(T x) {
    if(x > 9) write(x/10);
    putchar(x%10 + '0');
}

const double EPS = 1e-8;
double dist[104][104];
// (op, x, y)
tuple<int,int,int> fath[104][104];

using Item = tuple<double, int, int>;
void solve() {
  int n, t, xs, ys, xe, ye;
  read(n, t, xs, ys, xe, ye);
  vector<pii> pluses(n);
  for(auto &[x, y]: pluses) {
    read(x, y);
  }

  memset(dist, 0x7f, sizeof(dist));
  dist[xs][ys] = 0;
  priority_queue<Item, vector<Item>, greater<Item>> pq;
  pq.emplace(0, xs, ys);
  while(!pq.empty()) {
    auto [d, x, y] = pq.top();
    pq.pop();
    if(fabs(d - dist[x][y]) > EPS) continue;
    if(x == xe && y == ye) {
      printf("%.10f\n", d);
      vector<tuple<int,int,int>> path;
      int cx = x, cy = y;
      while(cx != xs || cy != ys) {
        auto [pid, lx, ly] = fath[cx][cy];
        path.emplace_back(pid, cx, cy);
        cx = lx;
        cy = ly;
      }
      reverse(all(path));
      cout << path.size() << '\n';
      for(auto [pid, px, py]: path) {
        cout << pid << ' ' << px << ' ' << py << '\n';
      }
      return;
    }
    rep(i, 0, 101) rep(j, 0, 101) {
      double nd = d + sqrt((i-x)*(i-x)+(j-y)*(j-y));
      if(nd < dist[i][j]-EPS) {
        pq.emplace(nd, i, j);
        dist[i][j] = nd;
        fath[i][j] = {0, x, y};
      }
    }
    rep(pid, 1, n+1) {
      auto [px, py] = pluses[pid-1];
      if(px != x && py != y) continue;
      double nd = d + t;
      rep(i, 0, 101) {
        if(nd < dist[px][i]) {
          pq.emplace(nd, px, i);
          dist[px][i] = nd;
          fath[px][i] = {pid, x, y};
        }
        if(nd < dist[i][py]) {
          pq.emplace(nd, i, py);
          dist[i][py] = nd;
          fath[i][py] = {pid, x, y};
        }
      }
    }
  }
}

signed main() {
  int T; T = 1;
  while(T--) solve();
  return 0;
}