//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
#define ld long double
#define pii pair<ld,ld>
void die(string S){puts(S.c_str());exit(0);}
const ld eps=1e-9;
int n,m;
pii a[200200];
pii b[200200];
ld alen[200200],blen[200200],psum[200200];
inline ld sqr(ld x){return x*x;}
inline ld dist(pii a,pii b){return sqrtl(sqr(a.first-b.first)+sqr(a.second-b.second));}
const ld IntersectError=-114514;
inline ld intersect(pii p1,pii p2,pii q1,pii q2)
{
	ld dx=q2.first-q1.first,dy=q2.second-q1.second;
	ld val=q1.first*dy-q1.second*dx;
	ld val2=p2.first*dy-p2.second*dx;
	ld dx2=p2.first-p1.first;
	ld dy2=p2.second-p1.second;
	ld delta=dx2*dy-dy2*dx;
	if(fabs(delta)<eps) return IntersectError;
	ld len=(val-val2)/delta;
	if(len<0) return IntersectError;
	ld dist1=dist(pii(p2.first+dx2*len,p2.second+dy2*len),q1);
	ld dist2=dist(pii(p2.first+dx2*len,p2.second+dy2*len),q2);
	if(dist1+dist2>dist(q1,q2)+eps) return IntersectError;
	return dist2;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		cin>>a[i].first>>a[i].second;
	for(int i=1;i<=m;i++)
		cin>>b[i].first>>b[i].second;
	for(int i=1;i<=n;i++)
		alen[i]=dist(a[i],a[i%n+1]);
	for(int i=1;i<=m;i++)
		blen[i]=dist(b[i],b[i%m+1]);
	ld s1=0;
	for(int i=1;i<=n;i++)
		s1+=alen[i];
	for(int i=1;i<=n;i++)
		psum[i]=psum[i-1]+alen[i];
	int p1=-1,p2=-1;
	ld len1=IntersectError,len2=IntersectError;
	for(int i=1;i<=n;i++)
	{
		ld val1=intersect(b[2],b[1],a[i],a[i%n+1]);
		ld val2=intersect(b[1],b[2],a[i],a[i%n+1]);
		if(val1!=IntersectError)
		{
			len1=val1;
			p1=i;
		}
		if(val2!=IntersectError)
		{
			len2=val2;
			p2=i;
		}
	}
	ld ans=0;
	for(int i=1;i<=m;i++)
	{
		ld tmp;
		while((tmp=intersect(b[i%m+1],b[i],a[p1],a[p1%n+1]))==IntersectError)
			p1=p1%n+1;
		len1=tmp;
		while((tmp=intersect(b[i],b[i%m+1],a[p2],a[p2%n+1]))==IntersectError)
			p2=p2%n+1;
		len2=tmp;
		ld tot=alen[p2]+len1-len2;
		if(p1<p2)
			tot+=psum[p2-1]-psum[p1];
		else
			tot+=psum[n]-psum[p1]+psum[p2-1];
		ans+=tot/s1*blen[i];
	}
	cout<<fixed<<setprecision(15)<<ans<<endl;
	return 0;
}