#include <bits/stdc++.h>

#define endl "\n"
using namespace std;
typedef long long LL;
typedef unsigned long long u64;
typedef pair<int, int> PII;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
#define pb push_back

struct Node {
    int number;
    int x;
    int y;
};

double dis (PII a, PII b) {
    return sqrt ((a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second));
}

void solve () {
    int n, t, aid = 0;
    cin >> n >> t;
    pair<int, int> p[n + 5];
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    PII pst, ped;
    int dst = 1e9, ded = 1e9;
    int idst, ided;
    for (int i = 1; i <= n; i++) {
        cin >> p[i].first >> p[i].second;
        if (dst > abs (p[i].first - x1)) {
            dst = abs (p[i].first - x1);
            pst = { p[i].first, y1 };
            idst = i;
        }
        if (dst > abs (p[i].second - y1)) {
            dst = abs (p[i].second - y1);
            pst = { x1, p[i].second };
            idst = i;
        }
        if (ded > abs (p[i].first - x2)) {
            ded = abs (p[i].first - x2);
            ped = { p[i].first, y2 };
            ided = i;
        }
        if (ded > abs (p[i].second - y2)) {
            ded = abs (p[i].second - y2);
            ped = { x2, p[i].second };
            ided = i;
        }
    }
    double ans = sqrt ((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
    vector<Node> path[3];
    path[0].push_back ({ 0, x2, y2 });
    if (n == 0) {
        cout << ans << endl;
        cout << 1 << endl;
        cout << 0 << " " << x2 << " " << y2 << endl;
        return;
    }
    for (int i = 1; i <= n; i++) {
        int tx = p[i].first, ty = p[i].second;
        vector<Node> tmp;
        int tans = 0;
        double cnt = 0;
        if (abs (x1 - tx) > abs (y1 - ty)) {
            tmp.push_back ({ 0, x1, ty });
        }
        else {
            tmp.push_back ({ 0, tx, y1 });
        }
        if (abs (x2 - tx) > abs (y2 - ty)) {
            tmp.push_back ({ i, x2, ty });
        }
        else {
            tmp.push_back ({ i, tx, y2 });
        }
        tmp.push_back ({ 0, x2, y2 });
        int lx = x1, ly = y1;
        for (auto [id, x, y] : tmp) {
            if (!id) {
                tans += sqrt ((x - lx) * (x - lx) + (y - ly) * (y - ly));
            }
            else {
                tans += t;
            }
            lx = x, ly = y;
        }
        if (tans < ans) {
            path[1] = tmp;
            aid = 1;
            ans = tans;
        }
    }
    path[2].push_back ({ 0, pst.first, pst.second });
    path[2].push_back ({ idst, p[ided].first, p[ided].second });
    path[2].push_back ({ ided, ped.first, ped.second });
    path[2].push_back ({ 0, x2, y2 });
    int tans = 0, lx = x1, ly = y1;
    for (auto [id, x, y] : path[2]) {
        if (!id) {
            tans += sqrt ((x - lx) * (x - lx) + (y - ly) * (y - ly));
        }
        else {
            tans += t;
        }
        lx = x, ly = y;
    }
    if (tans < ans) {
        aid = 2;
        ans = tans;
    }
    cout << ans << endl;
    cout << path[aid].size () << endl;
    for (auto [id, x, y] : path[aid]) {
        cout << id << " " << x << " " << y << endl;
    }
}

int main () {
    std::ios::sync_with_stdio (false);
    std::cin.tie (nullptr);
    std::cout.tie (nullptr);

    solve ();

    return 0;
}