#include<bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;


ld qi(pair<ld,ld> a,pair<ld,ld> b){
    if(a>b)swap(a,b);
    if(a==b){
        return (a.second-a.first)*1.0/3;
    }
    if(a.first==a.second){
        return abs((b.first+b.second)*1.0/2 - a.first);
    }
    if(b.first==b.second){
        return abs(b.first - (a.first+a.second)/2);
    }
    if(b.first>=a.second){
        return ((b.second + b.first) - (a.second + a.first))*1.0/2;
    }

    if(b.second<=a.second){//包含
        ld u = b.first - a.first;
        ld v = b.second - b.first;
        ld w = a.second - b.second;
        ld res = 0;
        res += (v/2+u/2)*u + v*(v/3) + w*(w/2 + v/2);
        res /= (u+v+w);
        return res;
    }else{//相交
        ld u = b.first - a.first;
        ld v = a.second - b.first;
        ld w = b.second - a.second;
        ld res = 0;
        res = u*(v+w+u)/2 + v*(v*v/3+w*(w+v)/2)/(v+w);
        res /= (u+v);
        return res;
    }
}
ll ssm1=0,ssm2 = 0;

ld quan1(pair<ld,ld> p){
    if(ssm1)return p.second- p.first;
    else return 1;
}

ld quan2(pair<ld,ld> p){
    if(ssm2)return p.second- p.first;
    else return 1;
}

signed main(){
    int n,m;cin>>n>>m;
    vector<pair<ld,ld> > vc1(n);
    vector<pair<ld,ld> > vc2(m);

    for(auto &it:vc1)cin>>it.first>>it.second,ssm1+=it.second - it.first;
    for(auto &it:vc2)cin>>it.first>>it.second,ssm2+=it.second - it.first;
    sort(vc1.begin(),vc1.end());
    sort(vc2.begin(),vc2.end());

    ld zq1=0,zq2=0;
    for(auto it:vc1)zq1+=quan1(it);
    for(auto it:vc2)zq2+=quan2(it);

    vector<ld > q1(n);
    vector<ld > q2(m);

    for(int i = 0 ; i < n ;++i)q1[i] = quan1(vc1[i])/zq1;
    for(int i = 0 ; i < m ;++i)q2[i] = quan2(vc2[i])/zq2;

    ld ans =0;
    ld sm1=0,sm2=0;
    ld he1 = 0,he2=0;
    for(int i = 0 ; i < m ;++i){
        auto it = vc2[i];
        sm2 += q2[i]*(it.second+it.first)/2;
        he2 += q2[i];
    }
    int p = 0,q=0;
    for(int j = 0 ; j < n ; ++j){
        auto it = vc1[j];
        while (p<vc2.size()&&vc2[p].second<=it.first){
            sm1 += q2[p]*(vc2[p].second + vc2[p].first)/2;
            he1 += q2[p];
            p++;
        }
        while(q<vc2.size()&&vc2[q].first<=it.second){
            sm2 -= q2[q]*(vc2[q].second + vc2[q].first)/2;
            he2 -= q2[q];
            q++;
        }
        ld uu = 0;
        uu = (it.second+it.first)/2*he1 - sm1;
        uu += sm2 - (it.second + it.first)/2*he2;

        for(int i = p;i<q;++i){
            uu += q2[i]*qi(it,vc2[i]);
        }
        ans += q1[j]*uu;
    }

    cout<<fixed<<setprecision(12)<<ans;

    return 0;

}