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

const int N = 101 * 101;

void solve() {
    int n, t;
    cin >> n >> t;
    int xs, ys, xt, yt;
    cin >> xs >> ys >> xt >> yt;
    vector<vector<int>> pnt(101, vector<int>(101, 0));
    vector<vector<double>> ans(101, vector<double>(101, 1e5));
    vector<vector<int>> chosen(101, vector<int>(101, 0));
    for (int i = 1; i <= n; i++) {
        int x, y;
        cin >> x >> y;
        pnt[x][y] = i;
    }
    vector fa(101, vector<tuple<int, int, int>>(101, {-1, -1, -1}));
    ans[xs][ys] = 0;
    for (int _ = 0; _ < N; _++) {
        int mn = 1e5;
        pair<int, int> mnp = {-1, -1};
        for (int i = 0; i <= 100; i++) {
            for (int j = 0; j <= 100; j++) {
                if (!chosen[i][j] && ans[i][j] < mn) {
                    mn = ans[i][j];
                    mnp = {i, j};
                }
            }
        }
        auto [x, y] = mnp;
        if (x == xt && y == yt) break;
        chosen[x][y] = 1;
        for (int i = 0; i <= 100; i++) {
            for (int j = 0; j <= 100; j++) {
                if (chosen[i][j]) continue;
                if (ans[x][y] + sqrt((i - x) * (i - x) + (j - y) * (j - y)) <
                    ans[i][j]) {
                    ans[i][j] =
                        ans[x][y] + sqrt((i - x) * (i - x) + (j - y) * (j - y));
                    fa[i][j] = {0, x, y};
                }
                if (ans[x][y] + t < ans[i][j]) {
                    if (pnt[i][y]) {
                        ans[i][j] = ans[x][y] + t;
                        fa[i][j] = {pnt[i][y], x, y};
                    } else if (pnt[x][j]) {
                        ans[i][j] = ans[x][y] + t;
                        fa[i][j] = {pnt[x][j], x, y};
                    }
                }
            }
        }
    }
    cout << fixed << setprecision(10) << ans[xt][yt] << "\n";
    vector<tuple<int, int, int>> res;
    for (int i = xt, j = yt; i != xs || j != ys;) {
        auto [tp, x, y] = fa[i][j];
        res.emplace_back(tp, i, j);
        i = x, j = y;
    }
    ranges::reverse(res);
    cout << res.size() << "\n";
    for (auto [tp, x, y] : res) {
        cout << tp << " " << x << " " << y << "\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}