#include <cmath>
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;
typedef long double db;
const db eps = 1e-8;
typedef long long ll;
int sgn(db x)
{
    if(fabs(x) < eps) return 0;
    if(x < 0) return -1;
    else return 1;
}

struct Point
{
    db x,y;
    Point(){}
    Point(db x_, db y_):x(x_),y(y_){}
    
    Point operator - (const Point& b){return Point(x-b.x,y-b.y);}
    db operator ^ (const Point& b){
        return x*b.y - y*b.x;
    }
    bool operator < (Point b) const {return sgn(x-b.x)==0?sgn(y-b.y)<0:x<b.x;}
    bool operator == (Point b) const {return sgn(x-b.x) == 0 && sgn(y-b.y) == 0;}
    bool operator <= (Point b) const {return sgn(x-b.x)==0?sgn(y-b.y)<=0:x<b.x;}
    db distance(Point p){
		return hypot(x-p.x,y-p.y);
	}
    void input(){
		scanf("%Lf %Lf",&x,&y);
	}
	void output(){
		printf("%.2f %.2f\n",x,y);
	}
};

struct Line
{
    Point s,e;
    Line(){}
    Line(Point s_, Point e_):s(s_),e(e_){}
    Line(db a, db b, db c)
    {
        if(sgn(a) == 0)
        {
            s = Point(0, -c/b);
            e = Point(1, -c/b);
        } else if(sgn(b) == 0)
        {
            s = Point(-c/a, 0);
            e = Point(-c/a, 1); 
        } else 
        {
            s = Point(0, -c/b);
            e = Point(1, (-c-a)/b);
        }
    }
    // 大坑！
    /*
    long long inf = 1e9;
    auto l1=Line(Point(-1,-1),Point(1,-1));
    auto l2=Line(Point(1,-inf),Point(inf,-1));
    auto p=l1.crosspoint(l2);
    p.output();
    */
    Point crosspoint(Line v)
    {
        // printf("crossing:\n");
        // s.output();e.output();
        // printf("with\n");
        // v.s.output();v.e.output();
        db a1 = (v.e-v.s)^(s-v.s);
        db a2 = (v.e-v.s)^(e-v.s);
        // printf("a1:%.10Lf a2:%.10Lf\n",a1,a2);
        // printf("res:");
        // printf("%.2Lf %.2Lf\n",(s.x*a2-e.x*a1)/(a2-a1), (s.y*a2-e.y*a1)/(a2-a1));
        // printf("a2-a1=%.10Lf\n",a2-a1);
        // printf("a2-a1=%.10Lf\n",db((ll)a2-(ll)a1));
        
        // printf("a2/(a2-a1)=%.10Lf\n",a2/(a2-a1));
        return Point(s.x*(a2/(a2-a1))-e.x*(a1/(a2-a1)), s.y*(a2/(a2-a1))-e.y*(a1/(a2-a1))); 
    }
    int linecrossseg(Line v)
    {
        // printf("crossing:\n");
        // s.output();e.output();
        // printf("with\n");
        // v.s.output();v.e.output();
		int d1 = sgn((e-s)^(v.s-s));
		int d2 = sgn((e-s)^(v.e-s));
		if((d1^d2)==-2) return 2;
		return (d1==0||d2==0);
	}
    bool parallel(Line v){
		return sgn((e-s)^(v.e-v.s)) == 0;
	}
    int relation(Point p){
		int c = sgn((p-s)^(e-s));
		if(c < 0)return 1;
		else if(c > 0)return 2;
		else return 3;
	}
    int linecrossline(Line v){
		if((*this).parallel(v))
			return v.relation(s)==3;
		return 2;
	}
    db length(){
		return s.distance(e);
	}
    db dispointtoline(Point p){
		return fabs((p-s)^(e-s))/length();
	}

};

db cross(Point A,Point B,Point C){
	return (B-A)^(C-A);
}

const int N=2e5+10;

Point ex[N],in[N];
db sum[N];

int n,m;

// 从ex[st]开始找 第一个与直线ln相交的线段ex[i]ex[i+1] 注意如果是ln恰好与端点相交，则须保证返回的点i是交点
int findInt(int st, Line ln)
{
    // printf("st=%d\n",st);
    int cur=st;
    for(;!ln.linecrossseg(Line(ex[cur],ex[(cur+1)%n]));cur=(cur+1)%n);
    if(ln.linecrossseg(Line(ex[cur],ex[(cur+1)%n])) == 1)
    {
        // printf("cur=%d\n",cur);
        // printf("line:");ln.s.output();ln.e.output();
        // printf("seg:");ex[cur].output();ex[(cur+1)%n].output();
        auto pt = ln.crosspoint(Line(ex[cur],ex[(cur+1)%n]));
        // printf("pt:");pt.output();
        if(pt == ex[(cur+1)%n])
            cur = (cur+1)%n;
    };
    return cur;
}


//从st对应边走到ed对应边的边长和，不包括st和ed对应边的边长，

// 为啥一开始这里写成int都能过11个点？？
db getLen(int st,int ed)
{
    if(st < ed)
        return sum[ed-1]-sum[st];
    else if(st == ed)
        return 0;
    else 
        return sum[n-1] - (sum[st] - (ed>0?sum[ed - 1]:0));
}

int main()
{
    // long long inf = 1e9;
    // auto l1=Line(Point(-1,-1),Point(1,-1));
    // auto l2=Line(Point(1,-inf),Point(inf,-1));
    // auto p=l1.crosspoint(l2);
    // p.output();
    scanf("%d %d",&n,&m);
    for(int i=0;i<n;i++)
        ex[i].input();
    for(int i=0;i<m;i++)
        in[i].input();
    
    sum[0]=Line(ex[0],ex[1]).length();
    for(int i=1;i<n;i++)
        sum[i] = sum[i-1] + Line(ex[i],ex[(i+1)%n]).length();
    
    int s = findInt(1, Line(in[0],in[1]));
    int t = findInt((s+1)%n, Line(in[0],in[1]));
    // 由于findInt特性，此处cross!=0
    if(cross(in[0],in[1],ex[(s+1)%n]) > 0)
        swap(s,t);

    db ans=0;
    for(int i=0;i<m;i++)
    {
        // printf("in[%d]:s=%d t=%d\n",i,s,t);
        db curLen = getLen(s,t);

        auto mid = Line(in[i],in[(i+1)%m]).crosspoint(Line(ex[s],ex[(s+1)%n]));
        curLen += mid.distance(ex[(s+1)%n]);
        mid = Line(in[i],in[(i+1)%m]).crosspoint(Line(ex[t],ex[(t+1)%n]));
        curLen += mid.distance(ex[t]);
        ans += Line(in[i],in[(i+1)%m]).length() * (curLen / sum[n-1]);  
        // printf("curLen=%.10Lf\n",curLen);
        s = findInt(s, Line(in[(i+1)%m],in[(i+2)%m]));
        t = findInt(t, Line(in[(i+1)%m],in[(i+2)%m]));


        if(s==t)
            s = findInt((s+1)%n, Line(in[(i+1)%m],in[(i+2)%m]));

        if(cross(in[(i+1)%m],in[(i+2)%m],ex[(s+1)%n]) > 0)
            swap(s,t);
    };
    printf("%.15Lf\n",ans);
    return 0;
}