Problem: The hobbits Frodo and Sam are carrying the One Ring to Mordor. In order not to be spotted by orcs, they decided to go through the mountains.

The mountain relief can be represented as a polyline with n points (x_i, y_i), numbered from 1 to n (x_i < x_{i + 1} for 1 ≤ i ≤ n - 1). Hobbits start their journey at the point (x_1, y_1) and should reach the point (x_n, y_n) to complete their mission.

The problem is that there is a tower with the Eye of Sauron, which watches them. The tower is located at the point (x_n, y_n) and has the height H, so the Eye is located at the point (x_n, y_n + H). In order to complete the mission successfully, the hobbits have to wear cloaks all the time when the Sauron Eye can see them, i. e. when there is a direct line from the Eye to the hobbits which is not intersected by the relief.

The hobbits are low, so their height can be considered negligibly small, but still positive, so when a direct line from the Sauron Eye to the hobbits only touches the relief, the Eye can see them.

<image> The Sauron Eye can't see hobbits when they are in the left position, but can see them when they are in the right position.

The hobbits do not like to wear cloaks, so they wear them only when they can be spotted by the Eye. Your task is to calculate the total distance the hobbits have to walk while wearing cloaks.

Input

The first line of the input contains two integers n and H (2 ≤ n ≤ 2 ⋅ 10^5; 1 ≤ H ≤ 10^4) — the number of vertices in polyline and the tower height.

The next n lines contain two integers x_i, y_i each (0 ≤ x_i ≤ 4 ⋅ 10^5; 0 ≤ y_i ≤ 10^4) — the coordinates of the polyline vertices. It is guaranteed that x_i < x_{i + 1} for 1 ≤ i ≤ n - 1.

Output

Print one real number — the total distance the hobbits have to walk while wearing cloaks. Your answer will be considered correct if its absolute or relative error does not exceed 10^{-6} — formally, if your answer is a, and the jury's answer is b, your answer will be accepted if (|a - b|)/(max(1, b)) ≤ 10^{-6}.

Examples

Input


6 10
10 40
20 10
25 30
30 15
50 15
65 30


Output


70.4034587602


Input


9 5
0 0
5 10
15 10
20 0
25 11
30 0
35 10
50 10
60 5


Output


27.2787986124


Input


2 10000
0 10000
400000 0


Output


400124.9804748512

Solution (in CPP):

Solution:
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
double A=clock();
#define setIO(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define closefile fclose(stdin),fclose(stdout)
#define see(x) cerr<<x<<" "
#define seeln(x) cerr<<x<<endl
#define out(x) cerr<<#x<<" = "<<x<<" "
#define outln(x) cerr<<#x<<" = "<<x<<endl
#define outarr(x,l,r) {cerr<<#x"["<<l<<"-"<<r<<"] = "; for (int _i=l;_i<=r;++_i) cerr<<x[_i]<<" "; cerr<<endl;}
#define user_time cerr<<fixed<<setprecision(6)<<(clock()-A)*1.0/CLOCKS_PER_SEC<<endl
#define m_p make_pair
#define sz(x) (int)x.size()
template <class T> void read(T &x)
{
	x=0; char c=getchar(); int flag=0;
	while (c<'0'||c>'9') flag|=(c=='-'),c=getchar();
	while (c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^48),c=getchar();
	if (flag) x=-x;
}
template <class T> T _max(T a,T b){return b>a ? b : a;}
template <class T> T _min(T a,T b){return b<a ? b : a;}
template <class T> bool checkmax(T &a,T b){return b>a ? a=b,1 : 0;}
template <class T> bool checkmin(T &a,T b){return b<a ? a=b,1 : 0;}
const int N=200005;
const double pi=acos(-1.0),eps=1e-9,inf=1e20;
int n,H;
int sgn(double x){return fabs(x)<eps ? 0 : (x>0 ? 1 : -1);}
int dcmp(double a,double b){return sgn(a-b);}
struct Point
{
	double x,y;
	Point(double _x=0,double _y=0):x(_x),y(_y){}
}a[N];
typedef Point Vector;
double sqr(double x){return x*x;}
double dist(Point a,Point b){return sqrt(sqr(a.x-b.x)+sqr(a.y-b.y));}
bool operator < (Vector a,Vector b){return a.x!=b.x ? a.x<b.x : a.y<b.y;}
bool operator == (Vector a,Vector b){return dcmp(a.x,b.x)==0&&dcmp(a.y,b.y)==0;}
Vector operator + (Vector a,Vector b){return Vector(a.x+b.x,a.y+b.y);}
Vector operator - (Vector a,Vector b){return Vector(a.x-b.x,a.y-b.y);}
Vector operator * (Vector a,double b){return Vector(a.x*b,a.y*b);}
Vector operator / (Vector a,double b){return Vector(a.x/b,a.y/b);}
double operator ^ (Vector a,Vector b){return a.x*b.x+a.y*b.y;}
double operator * (Vector a,Vector b){return a.x*b.y-a.y*b.x;}
double Length(Vector a){return sqrt(a^a);}
double Angle(Vector a,Vector b){return acos(a^b/Length(a)/Length(b));}
Vector Rotate(Vector a,double rad){return Vector(a.x*cos(rad)-a.y*sin(rad),a.x*sin(rad)+a.y*cos(rad));}
Point Line_intersection(Point p1,Vector v1,Point p2,Vector v2)
{
	//if (sgn(v1*v2)==0) return Point(-inf,-inf);
	double t=((p2-p1)*v2)/(v1*v2);
	return p1+v1*t;
}

void init()
{
	read(n); read(H);
	for (int i=1,x,y;i<=n;++i) 
	{
		read(x),read(y);
		a[i]=Point((double)x,(double)y);
	}
}

void solve()
{
	Point Eye=Point(a[n].x,a[n].y+H);
	Point M=a[n];
	double ans=0;
	for (int i=n-1;i>=1;--i)
	{
		Point L=a[i],R=a[i+1];
		int seeL=1,seeR=1;
		if (sgn((M-Eye)*(L-Eye))>0) seeL=0;
		if (sgn((M-Eye)*(R-Eye))>0) seeR=0;
		if (!seeL) continue;
		if (seeR) ans+=dist(L,R);
		else
		{
			Point P=Line_intersection(L,R-L,Eye,M-Eye);
			ans+=dist(L,P);
		}
		M=a[i];
	}
	printf("%.10lf\n",ans);
}

int main()
{
	//setIO("");
	init();
	solve();
	closefile;
	return 0;
}