#pragma GCC optimize("O2")
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <compare>
#include <complex>
#include <concepts>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numbers>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ranges>
#include <set>
#include <span>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>

#define int ll
#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

namespace R = std::ranges;
namespace V = std::views;

using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using tiii = tuple<int, int, int>;
using ldb = long double;
//#define double ldb

template<class T>
ostream& operator<<(ostream& os, const pair<T, T> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(const T &X : arr)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(const T &X : vec)
    os << X << ' ';
  return os;
}

double dist(array<int, 2> a, array<int, 2> b) {
  return sqrtl((a[0] - b[0]) * (a[0] - b[0]) + (a[1] - b[1]) * (a[1] - b[1]));
}

vector<tuple<int, int, double>> g[101][201];
double d[101][201];
array<int, 2> pre[101][201];

const double eps = 1e-9;

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  for(int i = 0; i < 101; i++)
    for(int j = 0; j < 201; j++)
      d[i][j] = DBL_MAX, pre[i][j] = {-1, -1};

  int n, t, sx, sy, tx, ty; cin >> n >> t >> sx >> sy >> tx >> ty;
  vector<array<int, 2>> pt(n);
  for(auto &[x, y] : pt)
    cin >> x >> y;

  for(int i = 0; i < 101; i++) {
    for(int j = 0; j < 101; j++) {
      for(int x = 0; x < 101; x++)
        g[i][j].emplace_back(x, j, abs(x - i));
      for(int y = 0; y < 101; y++)
        g[i][j].emplace_back(i, y, abs(y - j));
      g[i][j].emplace_back(tx, ty, dist({i, j}, {tx, ty}));
    }
  }

  for(int id = 101; auto [i, j] : pt) {
    for(int x = 0; x < 101; x++) {
      g[x][j].emplace_back(0, id, t);
      g[0][id].emplace_back(x, j, 0);
    }
    for(int y = 0; y < 101; y++) {
      g[i][y].emplace_back(0, id, t);
      g[0][id].emplace_back(i, y, 0);
    }
    id++;
  }

  d[sx][sy] = 0;
  using state = tuple<double, int, int>;
  priority_queue<state, vector<state>, greater<state>> pq;
  pq.push(make_tuple(0.0, sx, sy));

  while(!pq.empty()) {
    auto [D, i, j] = pq.top(); pq.pop();
    if (D > d[i][j] + eps) continue;
    for(auto [x, y, w] : g[i][j]) {
      if (d[x][y] == DBL_MAX or D + w < d[x][y] - eps) {
        pre[x][y] = {i, j}, d[x][y] = D + w;
        pq.push(make_tuple(D + w, x, y));
      }
    }
  }

  auto jp = [&](int &x, int &y) {
    auto [xp, yp] = pre[x][y];
    x = xp, y = yp;
  };

  vector<array<int, 3>> path;
  {
    int x = tx, y = ty;
    while(array<int, 2>{x, y} != array<int, 2>{sx, sy}) {
      if (pre[x][y][1] > 100) {
        path.push_back({pre[x][y][1] - 100, x, y});
        jp(x, y);
        jp(x, y);
      } else {
        path.push_back({0, x, y});
        jp(x, y);
      }
    }
    R::reverse(path);
  }

  cout << setprecision(9) << fixed;
  cout << d[tx][ty] << '\n';
  cout << ssize(path) << '\n';
  for(auto [x, y, z] : path)
    cout << x << ' ' << y << ' ' << z << '\n';

  return 0;
}