#include <cmath>
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
#define nxt(i, n) (i == n ? 1 : (i + 1))
#define rep(i, l, r) for (int i = l; i <= r; ++i)
typedef long double db; 
const int N = 4e5 + 5; 
const db eps = 1e-16; 
struct vec { db x, y; } a[N], b[N], va[N], vb[N];
struct line { vec p, d; } ;
int n, m, l[N], r[N]; db all, ans, la[N], lb[N], pre[N]; 

vec operator + (const vec &a, const vec &b) {
  return (vec){a.x + b.x, a.y + b.y}; 
}
vec operator - (const vec &a, const vec &b) {
  return (vec){a.x - b.x, a.y - b.y}; 
}
vec operator * (const db &a, const vec &b) {
  return (vec){a * b.x, a * b.y}; 
}
db operator * (const vec &a, const vec &b) {
  return a.x * b.y - a.y * b.x; 
}
db cross (line a, line b) {
  return fabs(a.d * b.d) < eps ? 0 : (b.p - a.p) * b.d / (a.d * b.d); 
}
db dist (vec a, vec b) {
  return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y)); 
} 

int main () {
  ios :: sync_with_stdio(0), cin.tie(0), cout.tie(0); 
  scanf("%d%d", &n, &m); 
  rep(i, 1, n) scanf("%Lf%Lf", &a[i].x, &a[i].y); 
  rep(i, 1, n) va[i] = a[nxt(i, n)] - a[i], all += (la[i] = dist((vec){0, 0}, va[i])); 
  rep(i, 1, m) scanf("%Lf%Lf", &b[i].x, &b[i].y); 
  rep(i, 1, m) vb[i] = b[nxt(i, m)] - b[i], lb[i] = dist((vec){0, 0}, vb[i]); 
  for (int i = 1, j = 1; i <= m; ++i) {
    db t; vec z; 
    for ( ; ; j = nxt(j, n)) {
      t = cross((line){b[i], vb[i]}, (line){a[j], va[j]});
      if(t <= 0) continue ; 
      z = b[i] + t * vb[i]; 
      if((fabs(z.x - a[j].x) - fabs(va[j].x) > -eps) && 
        (fabs(z.y - a[j].y) - fabs(va[j].y) > -eps)) continue ; 
      if((z.x - a[j].x) * va[j].x < 0 || (z.y - a[j].y) * va[j].y < 0) continue ; 
      break ; 
    }
    ans += lb[i] * dist(a[j], z); 
    r[i] = j; 
  }
  for (int i = 1, j = 1; i <= m; ++i) {
    db t; vec z; 
    for ( ; ; j = nxt(j, n)) {
      t = cross((line){b[i], vb[i]}, (line){a[j], va[j]});
      if(t >= 0) continue ; 
      z = b[i] + t * vb[i]; 
      if((fabs(z.x - a[j].x) - fabs(va[j].x) > -eps) && 
        (fabs(z.y - a[j].y) - fabs(va[j].y) > -eps)) continue ; 
      if((z.x - a[j].x) * va[j].x < 0 || (z.y - a[j].y) * va[j].y < 0) continue ; 
      break ; 
    }
    ans += lb[i] * dist(a[nxt(j, n)], z); 
    l[i] = nxt(j, n); 
  }
  rep(i, 1, n) a[i + n] = a[i], va[i + n] = va[i], la[i + n] = la[i]; 
  rep(i, 1, 2 * n) pre[i] = pre[i - 1] + la[i];
  rep(i, 1, m) {
    if(l[i] > r[i]) r[i] += n; 
    ans += lb[i] * (pre[r[i] - 1] - pre[l[i] - 1]); 
  } 
  printf("%.15Lf\n", ans / all); 
  return 0; 
}