#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
    int x;cin>>x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 400005
#define inf 0x3f3f3f3f

int n,m;

typedef long double db;
const db eps = 1e-12;
int sgn(db x){return x<-eps?-1:x>eps;}
int cmp(db a,db b){return sgn(a-b);}
struct P{
    db x,y;
    P (db xx=0,db yy=0){x=xx,y=yy;}
    P &operator +=(P o){return x+=o.x,y+=o.y,*this;}
    P &operator -=(P o){return x-=o.x,y-=o.y,*this;}
    friend P operator +(P a,P b){return a+=b;}
    friend P operator -(P a,P b){return a-=b;}
    friend db operator *(P a,P b){return a.x*b.y-a.y*b.x;}
    friend db operator %(P a,P b){return a.x*b.x+a.y*b.y;}

    friend P operator *(P a,db b){return P(a.x*b,a.y*b);}

    friend bool operator <(P a,P b){return cmp(a.x,b.x)==0?a.y<b.y:a.x<b.x;}
    db len(){
        return sqrt(x*x+y*y);
    }
    void out(){
        cout<<"("<<x<<","<<y<<")";
    }
};

db cross(P a,P b,P c){
    return (b-a)*(c-a);
}
int cmp3(P a,P b,P c){
    return sgn(cross(a,b,c));
}

vector<P>convex(vector<P>a){
    int n=a.size(),m=0;
    if(n<=1)return a;
    sort(a.begin(),a.end());
    vector<P>st(n*2); int tp=0;
    For(i,0,n-1){
        while(tp>1 && cmp3(st[tp-2],st[tp-1],a[i])<=0) --tp;
        st[tp++]=a[i];
    }
    int t=tp;
    Rep(i,n-2,0){
        while(tp>t && cmp3(st[tp-2],st[tp-1],a[i])<=0) --tp;
        st[tp++]=a[i];
    }
    st.resize(tp-1);
    return st;
}

vector<P>a;
P b[maxn],d[maxn],in1[maxn],in2[maxn];
db ql[maxn],qr[maxn];
db res;

db gmax(vector<P>&a,P b,P d){
    int n=a.size();
    db mx=0;
    /*for(auto p:a) {
        mx=max(mx,(p-b)%d);
    }*/
    if(a[0]%d>a[n-1]%d){
        int l=0,r=n-1;
        while(l+1<r){
            int mid=l+r>>1;
            if(a[mid]%d>a[l]%d && a[mid]%d>a[mid-1]%d) l=mid;
            else r=mid-1;
        }
        For(i,max(0,l-1),min(n-1,r+1)) mx=max(mx,(a[i]-b)%d);
    }else{
        int l=0,r=n-1;
        while(l+1<r){
            int mid=l+r>>1;
            if(a[mid]%d>a[r]%d && a[mid]%d>a[mid+1]%d) r=mid;
            else l=mid;
        }
        For(i,max(0,l-1),min(n-1,r+1)) mx=max(mx,(a[i]-b)%d);
    }
    return mx;
}

void cmax(vector<P>&a,int l,int r){
    For(i,l,r){
        ql[i]=min(ql[i],-gmax(a,b[i],P(0,0)-d[i]));
        qr[i]=max(qr[i],gmax(a,b[i],d[i]));
    }
}

void solve(int l,int r){
    if(l==r){
        int i=l;
        res+=(qr[i]-ql[i]);
        in1[i]=b[i]+d[i]*ql[i];
        in2[i]=b[i]+d[i]*qr[i];
        return;
    }
    int mid=l+r>>1;
    solve(mid+1,r);
    vector<P>p;
    For(i,mid+1,r) {
        p.pb(in1[i]);
        p.pb(in2[i]);
    }
    p=convex(p);
    cmax(p,l,mid);
    solve(l,mid);
}

void work()
{
    n=read(),m=read();
    For(i,1,n) {
        cin>>b[i].x>>b[i].y;
        cin>>d[i].x>>d[i].y;
        db ls=d[i].len();
        d[i].x/=ls,d[i].y/=ls;
    }
    a.resize(m);
    For(i,0,m-1) cin>>a[i].x>>a[i].y;
    a=convex(a);
    cmax(a,1,n);
    solve(1,n);
    printf("%.12lf\n",(double)res);
}

signed main()
{
   // cout<<(4.5*sqrt(2))<<"\n";
    int T=1;
    while(T--)work();
	return 0;
}
/*

*/