#include<bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3fll
#define debug(x) cerr<<#x<<"="<<x<<endl
using namespace std;
using ll=long long;
using ld=long double;
using pli=pair<ll,int>;
using pi=pair<int,int>;
template<typename A>
using vc=vector<A>;
using pd=pair<ld,ld>;
inline int read()
{
    int s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
inline ll lread()
{
    ll s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
const ld L=10000000000ll;
ld num[400005];
int numa[400005];
int numb[400005];
int len;
inline ld get(int *a,int *b)
{
    ld ans=0,lena=0,suma=0,lenb=0,sumb=0;
    for(int i=1;i<=len;i++)
    {
        ld l=num[i],r=num[i+1];
        if(a[i]) lena+=r-l,suma+=(r-l)*(l+r)/2;
        if(b[i]) lenb+=r-l,sumb+=(r-l)*(l+r)/2;
    }
    suma/=lena,sumb/=lenb;
    // printf("%Lf %Lf %Lf %Lf\n",lena,suma,lenb,sumb);

    ld P=0;
    for(int i=1;i<=len;i++)
    {
        ld l=num[i],r=num[i+1];
        ld Pb=(r-l)/lenb,Pa=(r-l)/lena;
        if(a[i])
        {
            ans+=P*Pa*(l+r)/2;
            // printf("i=%d ans=%Lf\n",i,ans);
            if(b[i])
            {
                ld t=r*r*r/3-l*l*l/3-l*r*r/2+l*l*l/2;
                ans+=t/lena/lenb;
            }
            // printf("i=%d ans=%Lf\n",i,ans);
        }
        if(b[i]) P+=Pb;
    }

    return 2*ans-suma;
}
int main()
{
    int n=read(),m=read();
    vc<pd>Sa,Sb;ld ma=0;
    for(int i=1;i<=n;i++){ ld l=num[++len]=lread()*L,r=lread()*L;Sa.push_back(pd(l,r)),ma=max(ma,r-l);}
    for(int i=1;i<=m;i++){ ld l=num[++len]=lread()*L,r=lread()*L;Sb.push_back(pd(l,r)),ma=max(ma,r-l);}
    for(int i=1;i<=n;i++) num[++len]=Sa[i-1].second=Sa[i-1].second+ma/L+1;
    for(int i=1;i<=m;i++) num[++len]=Sb[i-1].second=Sb[i-1].second+ma/L+1;

    for(auto i:Sa) printf("(%Lf,%Lf) ",i.first,i.second);;putchar('\n');
    for(auto i:Sb) printf("(%Lf,%Lf) ",i.first,i.second);;putchar('\n');

    sort(num+1,num+len+1),len=unique(num+1,num+len+1)-num-1;
    for(auto i:Sa)
    {
        int l=lower_bound(num+1,num+len+1,i.first)-num;
        int r=lower_bound(num+1,num+len+1,i.second)-num;
        for(int j=l;j<r;j++) numa[j]=1;
    }
    for(auto i:Sb)
    {
        int l=lower_bound(num+1,num+len+1,i.first)-num;
        int r=lower_bound(num+1,num+len+1,i.second)-num;
        for(int j=l;j<r;j++) numb[j]=1;
    }
    // for(int i=1;i<=len;i++) printf("%Lf ",num[i]);;putchar('\n');
    // for(int i=1;i<=len;i++) printf("%d ",numa[i]);;putchar('\n');
    // for(int i=1;i<=len;i++) printf("%d ",numb[i]);;putchar('\n');
    printf("%.20Lf\n",(get(numa,numb)+get(numb,numa))/L);
    return 0;
}
/*
1 1
1000000000 1000000000
-1000000000 1000000000
*/