#include <bits/stdc++.h>
using namespace std;
typedef long double lf;
struct point{
    lf x,y;
};
const lf inf =1e9;
lf dis(point a,point b){
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
point beg,ed;
int n;lf t;
lf cal(vector<pair<int,point>> p){
    if(p.empty())return dis(beg,ed);
    lf res=0;
    for(int i=0;i+1<(int)p.size();i++){
        if(p[i+1].first==0)res+=dis(p[i].second,p[i+1].second);
        else res+=t;
    }
    res+=dis(p[0].second,beg);
    // cout<<p.size()<<"\n";
    // for(auto it:p){
    //     cout<<it.first<<" "<<it.second.x<<" "<<it.second.y<<"\n";
    // }
    // cout<<"res="<<res<<"\n";
    return res;
}
point near(point p,point q){
    if(fabs(p.x-q.x)<fabs(p.y-q.y))return point{q.x,p.y};
    else return point{p.x,q.y};
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>t;
    vector<point> a(n+1);
    cin>>beg.x>>beg.y;
    cin>>ed.x>>ed.y;
    for(int i=1;i<=n;i++)cin>>a[i].x>>a[i].y;
    vector<pair<int,point>> ans;
    for(int i=1;i<=n;i++){
        vector<pair<int,point>> p;
        p.emplace_back(0,near(beg,a[i]));
        p.emplace_back(i,near(ed,a[i]));
        p.emplace_back(0,ed);
        if(cal(p)<cal(ans))ans=p;
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            vector<pair<int,point>> p;
            p.emplace_back(0,near(beg,a[i]));
            p.emplace_back(i,point{a[i].x,a[j].y});
            p.emplace_back(j,near(ed,a[j]));
            p.emplace_back(0,ed);
            if(cal(p)<cal(ans))ans=p;
        }
    }
    cout<<fixed<<setprecision(10)<<cal(ans)<<"\n";
    cout<<ans.size()<<"\n";
    for(auto it:ans){
        cout<<it.first<<" "<<it.second.x<<" "<<it.second.y<<"\n";
    }
}