#include <bits/stdc++.h>
using namespace std;
const int N = 310;
int n, m;
double dis[N][N];

struct P {
	int x, y;
	P(int X = 0, int Y = 0) : x(X), y(Y) {}
	inline P operator+(const P &yy)const { return P(x + yy.x, y + yy.y); }
	inline P operator-(const P &yy)const { return P(x - yy.x, y - yy.y); }
	inline int operator&(const P &yy)const { return 1ll * x * yy.x + 1ll * y * yy.y; }
	inline int operator*(const P &yy)const { return 1ll * x * yy.y - 1ll * y * yy.x; }
	inline bool operator==(const P &yy)const { return x == yy.x && y == yy.y; }
	double len() {
		return sqrt(1.0 * x * x + 1.0 * y * y);
	}
}; P a[N], b[N], c[N];
int id[N];
double d[N];

bool inside(P l, P r, P x) {
	P vec = r - l;
	if(vec * (x - l)) return 0;
	if(((l - x) & (r - x)) > 0) return 0;
	return 1;
}
bool inang(P l, P r, P x) {
	if(l * r > 0) {
		return l * x > 0 && x * r > 0;
	}
	else {
		return !(r * x >= 0 && x * l >= 0);
	}
}
double calc_dis(P x) {
	double res = 0;
	for(int i = 0; i < n; i++) {
		P vec = a[(i + 1) % n] - a[i];
		P l = a[i], r = a[(i + 1) % n];
		if(inside(l, r, x)) {
			res += (x - l).len();
			break;
		}
		res += vec.len();
	}
	return res;
}
bool check(int u, int v) {
	P x = c[u], y = c[v];
	if(x == y) return 1;
	for(int i = 0; i < n; i++) {
		P l = a[i], r = a[(i + 1) % n];
		int w1 = (x - l) * (y - l);
		int w2 = (x - r) * (y - r);
		int w3 = (l - x) * (r - x);
		int w4 = (l - y) * (r - y);
		if(w1 && w2 && w3 && w4 && (w1 > 0) != (w2 > 0) && (w3 > 0) != (w4 > 0))
			return 0;
		if(w1 == 0 || w2 == 0) continue;
		if(w3 == 0) {
			// x
			if((r - l) * (y - x) < 0) return 0;
		}
		if(w4 == 0) {
			// y
			if((r - l) * (x - y) < 0) return 0;
		}
	}
	for(int i = 0; i < n; i++) {
		if(!inside(x, y, a[i])) continue;
		P l = a[(i + n - 1) % n] - a[i];
		P r = a[(i + 1) % n] - a[i];
		if(!(x == a[i]) && inang(l, r, x - a[i])) return 0;
		if(!(y == a[i]) && inang(l, r, y - a[i])) return 0;
	}
	return 1;
}
int main() {
	ios::sync_with_stdio(0); cin.tie(nullptr);
	cout << fixed << setprecision(11);
	cin >> n >> m;
	for(int i = 1; i <= n; i++) {
		cin >> a[i - 1].x >> a[i - 1].y;
	}
	for(int i = 1; i <= m; i++) {
		cin >> b[i].x >> b[i].y;
		id[i] = i;
		d[i] = calc_dis(b[i]);
	}
	sort(id + 1, id + m + 1, [](int x, int y) { return d[x] < d[y]; });
	for(int i = 1; i <= m; i++) c[i] = b[id[i]];
	swap(b, c);
	for(int i = 1; i <= n; i++) c[i] = a[i - 1];
	for(int i = 1; i <= m; i++) c[i + n] = b[i];
	for(int i = 1; i <= n + m; i++)
		for(int j = i + 1; j <= n + m; j++) {
			dis[i][j] = dis[j][i] = 1e9;
			if(check(i, j)) {
				dis[i][j] = dis[j][i] = (c[i] - c[j]).len();
				// cout << ">>> " << i << " " << j << " : " << c[i].x << " " << c[i].y << " -> " << c[j].x << " " << c[j].y << "\n";
			}
		}
	for(int k = 1; k <= n + m; k++)
		for(int i = 1; i <= n + m; i++)
			for(int j = 1; j <= n + m; j++)
				if(dis[i][j] > dis[i][k] + dis[k][j])
					dis[i][j] = dis[i][k] + dis[k][j];
	double ans = 0;
	for(int i = 1; i <= m; i++) {
		ans += dis[n + i][n + i % m + 1];
	}
	cout << ans << "\n";
	return 0;
}
// 8 2
// 0 0
// 4 0
// 4 4
// 0 4
// 0 3
// 3 3
// 3 1
// 0 1
// 0 0
// 0 4