#include "bits/stdc++.h"
using namespace std;
typedef long long ll;

#define rep(i, begin, end) for(int i = begin; i < end; i++)
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define sq(x) (x)*(x)

const int N = 112345;
const int inf = 1e9+7;

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

    array<int,2> ini, fim;
    cin >> ini[0] >> ini[1];
    cin >> fim[0] >> fim[1];

    vector<array<int,2>> plus(n);
    rep(i,0,n) cin >> plus[i][0] >> plus[i][1];
    int mini = 1e9, ind_mini = 0;

    rep(i,0,n){
        if(min(abs(fim[0] - plus[i][0]), abs(fim[1] - plus[i][1])) < mini){
            ind_mini = i;
            mini = min(abs(fim[0] - plus[i][0]), abs(fim[1] - plus[i][1]));
        }
    }
    // cout << "M " << mini << '\n';
    int res = 1e9;
    int oto = -1;
    rep(i,0,n){
        int dist_ini = min(abs(ini[0] - plus[i][0]), abs(ini[1] - plus[i][1]));
        int dist_fim = min(abs(fim[0] - plus[i][0]), abs(fim[1] - plus[i][1]));
        // cout << "INI " << dist_ini << " FIM " << dist_fim << " T " << t<< '\n';
        if(i == ind_mini){
            if(dist_ini + t + dist_fim < res){
                oto = -1;
                res = dist_ini + t + dist_fim;
            }
        }
        if(dist_ini + mini + 2*t < res){
            oto = i;
            res = dist_ini + mini + 2*t;
        }
    }

    long double aux = sqrtl(sq(ini[0]-fim[0]) + sq(ini[1]-fim[1]));

    cout << fixed << setprecision(6);
    // cout << res << '\n';
    if((long double)res > aux){
        cout << aux << '\n';
        cout << 1 << '\n';
        cout << 0 << " " << fim[0] << " " << fim[1] << '\n';
        return;
    }

    cout << (long double)res << '\n';
    if(oto == -1){
        bool cond1 = fim[0] == plus[ind_mini][0] || fim[1] == plus[ind_mini][1];
        bool cond2 = ini[0] == plus[ind_mini][0] || ini[1] == plus[ind_mini][1];
        cout << 3 - cond1 - cond2 << '\n';
        if(!cond2){
        if(abs(ini[0] - plus[ind_mini][0]) < abs(ini[1] - plus[ind_mini][1])){
            cout << 0 << " " << plus[ind_mini][0] << " " << ini[1] << '\n';
        }else
            cout << 0 << " "<< ini[1] << " " << plus[ind_mini][1] << '\n';}

        if(abs(fim[0] - plus[ind_mini][0]) < abs(fim[1] - plus[ind_mini][1])){
            cout << ind_mini + 1 << " " << plus[ind_mini][0] << " " << fim[1] << '\n';
        }else
            cout << ind_mini + 1 << " "<< fim[0] << " " << plus[ind_mini][1] << '\n';

        if(!cond1)
        cout << 0 << " " << fim[0] << " " << fim[1] << '\n';
    }else{
        bool cond1 = fim[0] == plus[ind_mini][0] || fim[1] == plus[ind_mini][1];
        bool cond2 = ini[0] == plus[oto][0] || ini[1] == plus[oto][1];
        // cout << ini[0] << " " << plus[oto][0] << " " <<  ini[1] << " " << plus[oto][1] << '\n';
        cout << 4 - cond1 - cond2 << '\n';
        if(!cond2)
            if(abs(ini[0] - plus[oto][0]) < abs(ini[1] - plus[oto][1])){
                cout << 0 << " " << plus[oto][0] << " " << ini[1] << '\n';
            }else
                cout << 0 << " "<< ini[1] << " " << plus[oto][1] << '\n';

        cout << oto +1 << " " << plus[oto][0] << " " << plus[ind_mini][1] << '\n'; 

        if(abs(fim[0] - plus[ind_mini][0]) < abs(fim[1] - plus[ind_mini][1])){
            cout << ind_mini + 1 << " " << plus[ind_mini][0] << " " << fim[1] << '\n';
        }else
            cout << ind_mini + 1 << " "<< fim[1] << " " << plus[ind_mini][1] << '\n';

        if(!cond1)
        cout << 0 << " " << fim[0] << " " << fim[1] << '\n';
    }

}

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    // cin >> t;
    while (t--)
        solvetask();
        // cout << (solvetask() ? "Yes" : "No") << '\n';
}