#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
const ld eps=1e-11;
const ld inf=1e18;
const int maxn=(3e5)+10;
int n,m;
struct node {
    ld x,y;
    friend node operator + (node A,node B) { return (node){A.x+B.x,A.y+B.y}; }
    friend node operator - (node A,node B) { return (node){A.x-B.x,A.y-B.y}; }
    void get() { scanf("%Lf %Lf",&x,&y); }
    friend ld operator * (node A,node B) { return A.x*B.y-A.y*B.x; }
    void print() { printf("(%.5Lf %.5Lf)\n",x,y); }
} p[maxn],d[maxn];
ld ans;
vector<node> v[2];
bool cmp0(node A,node B) {
    if (fabs(A.x-B.x)<eps) return A.y<B.y;
    return A.x<B.x;
}
bool cmp1(node A,node B) {
    if (fabs(A.x-B.x)<eps) return A.y>B.y;
    return A.x<B.x;
}
void insert(vector<node> &vec,node A,int op) {
    if (op==0) {
        while ((int)vec.size()>1&&(A-vec.back())*(vec.back()-vec[(int)vec.size()-2])<0) vec.pop_back();
    } else {
        while ((int)vec.size()>1&&(A-vec.back())*(vec.back()-vec[(int)vec.size()-2])>0) vec.pop_back();
    }
    vec.push_back(A);
}
void chkmin(ld &x,ld y) { if (x>y) x=y; }
void chkmax(ld &x,ld y) { if (x<y) x=y; }
int main() {
    // freopen("qwq.in","r",stdin);
    scanf("%d %d",&n,&m);
    for (int i=1;i<=n;i++) {
        p[i].get();
        d[i].get();
    }
    vector<node> vec(m);
    for (int i=0;i<m;i++) vec[i].get();
    sort(vec.begin(),vec.end(),cmp0);
    for (node &A : vec) insert(v[0],A,0);
    sort(vec.begin(),vec.end(),cmp1);
    for (node &A : vec) insert(v[1],A,1);
    // for (node &A : v[0]) A.print();
    // puts("");
    // for (node &A : v[1]) A.print();
    vec.clear();
    for (int i=n;i>=1;i--) {
        if (fabs(d[i].y)<eps) {
            ld now=p[i].x,l=v[0][0].x,r=v[0].back().x;
            for (node &A : vec) chkmin(l,A.x),chkmax(r,A.x);
            chkmin(l,now),chkmax(r,now);
            ans+=r-l;
            vec.push_back((node){l,p[i].y});
            vec.push_back((node){r,p[i].y});
        } else {
            ld k=-d[i].x/d[i].y;
            ld l=p[i].y-k*p[i].x,r=l;
            for (node &A : vec) chkmin(l,A.y-k*A.x),chkmax(r,A.y-k*A.x);
            for (int op=0;op<=1;++op) {
                int L=0,R=(int)v[op].size()-2;
                while (L<=R) {
                    int mid=(L+R)>>1;
                    ld t1=v[op][mid].y-k*v[op][mid].x;
                    ld t2=v[op][mid+1].y-k*v[op][mid+1].x;
                    chkmin(l,t1),chkmin(l,t2),chkmax(r,t1),chkmax(r,t2);
                    if (fabs(t1-t2)<eps||R-L<=1) break;
                    if (!op) {
                        if (t1>t2) R=mid;
                        else L=mid+1;
                    } else {
                        if (t1<t2) R=mid;
                        else L=mid+1;
                    }
                }
                // for (node &A : v[op]) chkmin(l,A.y-k*A.x),chkmax(r,A.y-k*A.x);
            }
            ans+=(r-l)/sqrtl(k*k+1.0);
            if (fabs(k)<eps) {
                vec.push_back((node){p[i].x,l});
                vec.push_back((node){p[i].x,r});
            } else {
                ld t1=p[i].y-l-k*p[i].x;
                ld t2=p[i].y-r-k*p[i].x;
                t1/=k+1/k;
                t2/=k+1/k;
                vec.push_back((node){p[i].x+t1,p[i].y-t1/k});
                vec.push_back((node){p[i].x+t2,p[i].y-t2/k});
            }
        }
        // vec[(int)vec.size()-2].print();
        // vec.back().print();
    }
    printf("%.15Lf\n",ans);
    return 0;
}