// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
// #define debug
int n, t;
double sx, sy, ex, ey, x[105], y[105];
std::tuple<double, int, double, double> from[105];
bool vis[105];
std::vector<std::tuple<int, double, double>> ans;
void print()
{
    int cur = n + 1;
    ans.push_back({0, ex, ey});
    while (cur)
    {
        ans.push_back({std::get<1>(from[cur]), std::get<2>(from[cur]), std::get<3>(from[cur])});
        cur = std::get<1>(from[cur]);
    }
    std::reverse(ans.begin(), ans.end());
    std::cout << ans.size() << std::endl;
    for (auto i : ans)
        std::cout << std::get<0>(i) << ' ' << std::get<1>(i) << ' ' << std::get<2>(i) << std::endl;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n >> t >> sx >> sy >> ex >> ey;
    for (int i = 1; i <= n; ++i)
        std::cin >> x[i] >> y[i];
    for (int i = 1; i <= n; ++i)
        from[i] = std::min(std::make_tuple(std::abs(x[i] - sx), 0, x[i], sy),
                           std::make_tuple(std::abs(y[i] - sy), 0, sx, y[i]));
    from[n + 1] = std::make_tuple(std::hypot(sx - ex, sy - ey), 0, ex, ey);
    for (int i = 1; i <= n; ++i)
    {
        int k = n + 1;
        for (int j = 1; j <= n; ++j)
            if (!vis[j] && from[j] < from[k])
                k = j;
        if (k == n + 1)
            break;
        vis[k] = true;
        double d = std::get<0>(from[k]);
        for (int j = 1; j <= n; ++j)
            from[j] = std::min(from[j],
                               std::make_tuple(d + t, k, x[k], y[j]));
        from[n + 1] = std::min(from[n + 1],
                               std::min(std::make_tuple(d + t + std::abs(y[k] - ey), k, ex, y[k]),
                                        std::make_tuple(d + t + std::abs(x[k] - ex), k, x[k], ey)));
    }
    std::cout << std::fixed << std::setprecision(10) << std::get<0>(from[n + 1]) << std::endl;
    print();
    return 0;
}