#include<bits/stdc++.h>
using namespace std;
using db=long double;
const db eps=1e-21;
const int B=1000;
int sgn(db x)
{
	if(x<-eps) return -1;
	else if(x>eps) return 1;
	else return 0;
}
struct Vec
{
	db x,y;
	Vec(db a=0,db b=0) {x=a,y=b;}
	db norm() {return x*x+y*y;}
	db abs() {return sqrt(norm());}
};
Vec operator + (Vec x,Vec y) {return Vec(x.x+y.x,x.y+y.y);}
Vec operator - (Vec x,Vec y) {return Vec(x.x-y.x,x.y-y.y);}
Vec operator * (Vec x,db y) {return Vec(x.x*y,x.y*y);}
db cdot(Vec x,Vec y) {return x.x*y.x+x.y*y.y;}
db cross(Vec x,Vec y) {return x.x*y.y-x.y*y.x;}
int ccw(Vec x,Vec y,Vec z) {return sgn(cross(y-x,z-x));}
vector<Vec> convex(vector<Vec> a)
{
	int n=a.size();
	int mnx=0;
	for(int i=0;i<n;i++) if(sgn(a[i].x-a[mnx].x)==-1||(sgn(a[i].x-a[mnx].x)==0&&sgn(a[i].y-a[mnx].y)==-1)) mnx=i;
	swap(a[mnx],a[0]);
	sort(a.begin()+1,a.end(),[&](Vec x,Vec y){
		return ccw(a[0],x,y)==-1||(ccw(a[0],x,y)==0&&(x-a[0]).norm()<(y-a[0]).norm());
	});
	vector<int> st; int tp=0;
	st.push_back(0),tp++;
	for(int i=1;i<n;i++)
	{
		if(sgn(a[i].x-a[i-1].x)==0&&sgn(a[i].y-a[i-1].y)==0) continue;
		while(tp>=2&&ccw(a[st[tp-2]],a[st[tp-1]],a[i])>=0) tp--,st.pop_back();
		st.push_back(i),tp++;
	}
	vector<Vec> ans;
	for(int i=tp-1;i>=0;i--) ans.push_back(a[st[i]]);
	return ans;
}
struct Seg
{
	Vec s,t;
	Seg() {}
	Seg(Vec a,Vec b) {s=a,t=b;}
	Vec point(db p) {return s+(t-s)*p;}
};
Vec proj(Seg l,Vec x)
{
	db p=cdot(l.t-l.s,x-l.s)/(l.t-l.s).norm();
	return l.point(p);
}
#define N 100005
int n,m;
Vec h[N],d[N];
vector<Vec> bads;
vector<Vec> v;
int findmin(const vector<Vec> &a,auto cmp)
{
	int l=0,r=a.size()-1,d=1;
	if(cmp(a.back(),a[0])) swap(l,r),d=-1;
	for(;(r-l)*d>1;)
	{
		int mid=(l+r)/2;
		if(cmp(a[mid],a[mid-d])&&cmp(a[mid],a[l])) l=mid;
		else r=mid;
	}
	return l;
}
void rebuild()
{
	for(auto i:bads) v.push_back(i);
	v=convex(v);
	// for(auto [x,y]:v) printf("%Lf %Lf\n",x,y);
	bads.clear();
}
vector<Vec>p[N<<2];
void modify(int u, int l, int r, int x, Vec y) {
	p[u].push_back(y);
	if ((int)p[u].size() == (r - l + 1) * 2) p[u] = convex(p[u]);
	if (l == r) return;
	int mid = (l + r) >> 1;
	if (mid >= x) modify(u << 1, l, mid, x, y);
	else modify(u << 1 | 1, mid + 1, r, x, y);
}
int CID;
Vec L,R;
int cmp1(Vec x,Vec y)
{
	return cdot(d[CID],x-h[CID])<cdot(d[CID],y-h[CID]);
}
int cmp2(Vec x,Vec y)
{
	return cdot(d[CID],x-h[CID])>cdot(d[CID],y-h[CID]);
}
void queryA(int u, int L, int R, int l, int r) {
	if(l>r) return ;
	if (l <= L && R <= r) {
		int tid=findmin(p[u],cmp1);
		if(cmp1(p[u][tid],::L)) ::L=p[u][tid];
		return;
	}
	int mid = (L + R) >> 1;
	if (mid >= l) queryA(u << 1, L, mid, l, r);
	if (mid + 1 <= r) queryA(u << 1 | 1, mid + 1, R, l, r);
}
void queryB(int u, int L, int R, int l, int r) {
	if(l>r) return ;
	if (l <= L && R <= r) {
		int tid=findmin(p[u],cmp2);
		if(cmp2(p[u][tid],::R)) ::R=p[u][tid];
		return;
	}
	int mid = (L + R) >> 1;
	if (mid >= l) queryB(u << 1, L, mid, l, r);
	if (mid + 1 <= r) queryB(u << 1 | 1, mid + 1, R, l, r);
}
signed main()
{
#ifdef xay5421
	freopen("b.in","r",stdin);
#endif
	cin>>n>>m;
	for(int i=1;i<=n;i++) scanf("%Lf %Lf",&h[i].x,&h[i].y),scanf("%Lf %Lf",&d[i].x,&d[i].y);
	v.resize(m);
	for(int i=0;i<m;i++) scanf("%Lf %Lf",&v[i].x,&v[i].y);
	v=convex(v);
	db ans=0;
	for(int i=n;i>=1;i--)
	{
		CID=i;
		L=h[i],R=h[i];
		int id1=findmin(v,cmp1);
		if(cmp1(v[id1],L)) L=v[id1];
		queryA(1,1,n,i+1,n);
		int id2=findmin(v,cmp2);
		if(cmp2(v[id2],R)) R=v[id2];
		queryB(1,1,n,i+1,n);
		Vec A=proj(Seg(h[i],h[i]+d[i]),L);
		Vec B=proj(Seg(h[i],h[i]+d[i]),R);
		ans+=(B-A).abs();
		// printf("%d : %Lf %Lf %Lf %Lf\n",i,A.x,A.y,B.x,B.y);
		// bads.push_back(A);
		// bads.push_back(B);
		modify(1, 1, n, i, A);
		modify(1, 1, n, i, B);
	}
	printf("%.11Lf\n",ans);
	return 0;
}