#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define INF 0x3f3f3f3f
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<double, int> PDI;
typedef unsigned long long ULL;
const int N = 1e2 + 10;
const int mod = 998244353;
const double eps = 1e-5;

double f[N][N][N];
PDI mnx[N][N], mny[N][N];
int X[N], Y[N];
int sx, sy, tx, ty;
double dist(double x0, double y0, double x1, double y11)
{
    return sqrt((x0 - x1) * (x0 - x1) + (y0 - y11) * (y0 - y11));
}

struct Operation
{
    double x, y;
    int id;
    Operation() {}
    Operation(double _x, double _y, int _id) : x(_x), y(_y), id(_id) {}
};
vector<Operation> ans;
map<PII, Operation> path;
int cmp(double x, double y)
{
    if (fabs(x - y) < eps)
        return 0;
    if (x < y)
        return -1;
    return 1;
}

void dfs(int curx, int cury, int num)
{
    if (curx == sx && cury == sy)
        return;
    if (num == 0) // 不用plus
    {
        ans.push_back(Operation(curx, cury, 0));
        return; // 从起点走到(curx, cury), 结束
    }
    else if (cmp(f[num][curx][cury], f[num - 1][curx][cury]) >= 0) // 不用plus num
    {
        dfs(curx, cury, num - 1);
    }
    else // 用plus num
    {
        if (cmp(fabs(curx - X[num]), fabs(cury - Y[num])) == -1)
        {
            // (X[num], cury) -> (curx, cury)
            if (fabs(curx - X[num]) > eps)
                ans.push_back(Operation(curx, cury, 0));

            // (X[num], cury)
            if (mnx[num - 1][X[num]].first < mny[num - 1][Y[num]].first - eps)
            {
                // (X[num], second)
                if (fabs(cury - mnx[num - 1][X[num]].second) >= eps)
                {
                    ans.push_back(Operation(X[num], cury, num));
                }
                dfs(X[num], mnx[num - 1][X[num]].second, num - 1);
            }
            else
            {
                // (second, Y[num])
                if (fabs(mny[num - 1][Y[num]].second - X[num]) < eps && fabs(cury - Y[num]) < eps)
                {
                    dfs(mny[num - 1][Y[num]].second, Y[num], num - 1);
                }
                else
                {
                    ans.push_back(Operation(X[num], cury, num));
                    dfs(mny[num - 1][Y[num]].second, Y[num], num - 1);
                }
            }
        }
        else // (curx, Y[num])
        {
            if (fabs(Y[num] - cury) >= eps)
            {
                ans.push_back(Operation(curx, cury, 0));
            }

            if (mnx[num - 1][X[num]].first < mny[num - 1][Y[num]].first - eps)
            {
                // (X[num], second)
                if (fabs(curx - X[num]) >= eps || fabs(Y[num] - mnx[num - 1][X[num]].second) >= eps)
                {
                    ans.push_back(Operation(curx, Y[num], num));
                }
                dfs(X[num], mnx[num - 1][X[num]].second, num - 1);
            }
            else
            {
                // (second, Y[num])
                if (fabs(mny[num - 1][Y[num]].second - curx) < eps)
                {
                    dfs(mny[num - 1][Y[num]].second, Y[num], num - 1);
                }
                else
                {
                    ans.push_back(Operation(curx, Y[num], num));
                    dfs(mny[num - 1][Y[num]].second, Y[num], num - 1);
                }
            }
        }
        // t + min(mnx[i - 1][X[i]].first, mny[i - 1][Y[i]].first) + min(fabs(x - X[i]), fabs(y - Y[i]))
    }
}

void solve()
{
    int n, t;
    cin >> n >> t;

    cin >> sx >> sy >> tx >> ty;
    for (int i = 1; i <= n; i++)
        cin >> X[i] >> Y[i];
    for (int i = 0; i <= 100; i++)
    {
        for (int j = 0; j <= 100; j++)
        {
            mnx[j][i] = mny[j][i] = make_pair(1e9, 110);
        }
    }
    for (int i = 0; i <= 100; i++)
        for (int j = 0; j <= 100; j++)
        {
            f[0][i][j] = dist(sx, sy, i, j);
            // path[make_pair(i, j)] = Operation(sx, sy, 0);
            //			cout << i << ' ' << j << ' '<< f[0][i][j] << endl;
            if (mnx[0][i].first >= f[0][i][j])
            {
                mnx[0][i].first = min(mnx[0][i].first, f[0][i][j]);
                mnx[0][i].second = j;
            }
            if (mny[0][j].first >= f[0][i][j])
            {
                mny[0][j].first = min(mny[0][j].first, f[0][i][j]);
                mny[0][j].second = i;
            }
        }
    for (int i = 1; i <= n; i++)
    {
        for (int x = 0; x <= 100; x++)
        {
            for (int y = 0; y <= 100; y++)
            {
                f[i][x][y] = min(f[i - 1][x][y], t + min(mnx[i - 1][X[i]].first, mny[i - 1][Y[i]].first) + min(fabs(x - X[i]), fabs(y - Y[i])));
            }
        }

        for (int x = 0; x <= 100; x++)
        {
            for (int y = 0; y <= 100; y++)
            {
                if (mnx[i][x].first >= f[i][x][y])
                {
                    mnx[i][x].first = min(mnx[i][x].first, f[i][x][y]),
                    mnx[i][x].second = y;
                }
                if (mny[i][y].first >= f[i][x][y])
                {
                    mny[i][y].first = min(mny[i][y].first, f[i][x][y]);
                    mny[i][y].second = x;
                }
            }
        }
    }
    cout << fixed << setprecision(5) << f[n][tx][ty] << endl;
    dfs(tx, ty, n);
    cout << (int)ans.size() << '\n';
    for (int i = (int)ans.size() - 1; i >= 0; i--)
    {
        cout << ans[i].id << ' ' << ans[i].x << ' ' << ans[i].y << endl;
    }
}

/*
1 2
1 1
5 2
6 2
*/
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T;
    T = 1;
    while (T--)
        solve();
}