#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) os << v[i] << (i + 1 == int(v.size()) ? "" : " ");
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                             \
    cerr << " ";                                                               \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]\n"; \
    cerr << " ";                                                               \
    debug_out(__VA_ARGS__)
#else
#define debug(...) void(0)
#endif

constexpr int INF = (1 << 30) - 1;
const string target = "spbsu";

double dist(int x1, int y1, int x2, int y2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
    int n, t;
    cin >> n >> t;
    int sx, sy, gx, gy;
    cin >> sx >> sy >> gx >> gy;
    vector<int> X(n), Y(n);
    for (int i = 0; i < n; i++) cin >> X[i] >> Y[i];
    double mini = INF;
    vector<tuple<int, double, double>> ans;
    auto update = [&](const vector<tuple<int, double, double>>& v) {
        int x = sx, y = sy;
        double sum = 0;
        for (auto [p, nx, ny] : v) {
            if (p == 0)
                sum += dist(x, y, nx, ny);
            else
                sum += t;
            x = nx, y = ny;
        }
        if (chmin(mini, sum)) ans = v;
    };
    {
        vector<tuple<int, double, double>> tmp;
        tmp.emplace_back(0, gx, gy);
        update(tmp);
    }

    for (int i = 0; i < n; i++) {  // 1 回
        vector<tuple<int, double, double>> tmp;
        if (abs(X[i] - sx) < abs(Y[i] - sy))
            tmp.emplace_back(0, X[i], sy);
        else
            tmp.emplace_back(0, sx, Y[i]);
        if (abs(X[i] - gx) < abs(Y[i] - gy)) {
            tmp.emplace_back(i + 1, X[i], gy);
            tmp.emplace_back(0, gx, gy);
        } else {
            tmp.emplace_back(i + 1, gx, Y[i]);
            tmp.emplace_back(0, gx, gy);
        }
        update(tmp);
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {  // 2 回
            vector<tuple<int, double, double>> tmp;
            if (abs(X[i] - sx) < abs(Y[i] - sy))
                tmp.emplace_back(0, X[i], sy);
            else
                tmp.emplace_back(0, sx, Y[i]);
            tmp.emplace_back(i + 1, X[i], Y[j]);
            if (abs(X[j] - gx) < abs(Y[j] - gy)) {
                tmp.emplace_back(j + 1, X[j], gy);
                tmp.emplace_back(0, gx, gy);
            } else {
                tmp.emplace_back(j + 1, gx, Y[j]);
                tmp.emplace_back(0, gx, gy);
            }
            update(tmp);
        }
    }

    cout << mini << '\n';
    cout << ans.size() << '\n';
    for (auto [p, x, y] : ans) cout << p << ' ' << x << ' ' << y << '\n';
}