#include <bits/stdc++.h>  
using namespace std;  

#define int long long  

using db = long double;

#define fi first
#define se second

signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

    cout << fixed << setprecision(20);

	int n, m;
	cin >> n >> m;

	vector<pair<int, int>> a(n), b(m);
	for (auto &[l, r] : a) {
		cin >> l >> r;
	}
	for (auto &[l, r] : b) {
		cin >> l >> r;
	}

	sort(a.begin(), a.end());
	sort(b.begin(), b.end());
	
	auto check = [&](const vector<pair<int, int>> &t) {
		for (auto [x, y] : t) {
			if (x != y) {
				return true;
			}
		}
		return false;
 	};

 	auto work = [&](const vector<pair<int, int>> &t) {
 		vector<pair<int, int>> ret;
 		for (auto [x, y] : t) {
 			if (x != y) {
 				ret.push_back({x, y});
 			}
 		}
 		return ret;
 	};

 	bool oka = check(a), okb = check(b);
 	if (oka) {
 		a = work(a);
 		n = a.size(); 
 	} 
 	if (okb) {
 		b = work(b);
 		m = b.size();
 	}

 	if (!oka && !okb) {
 		vector<int> s(m + 1);
 		for (int i = 1; i <= m; i++) {
 			s[i] = s[i - 1] + b[i - 1].fi;
 		}
 		auto query = [&](int ql, int qr) {
 			return s[qr] - s[ql - 1];
 		};
 		db ans = 0;
 		for (auto [x, y] : a) {
 			int l = -1, r = m;
 			while (l + 1 != r) {
 				int mid = (l + r) / 2;
 				if (b[mid].fi <= x) {
 					l = mid;
 				} else {
 					r = mid;
 				}
 			} 
 			if (l == -1) {
 				continue;
 			}
 			ans += (l + 1) * x - query(1, l + 1);
 		}

		for (auto [x, y] : a) {
 			int l = -1, r = m;
 			while (l + 1 != r) {
 				int mid = (l + r) / 2;
 				if (b[mid].fi >= x) {
 					r = mid;
 				} else {
 					l = mid;
 				}
 			} 
 			if (r == m) {
 				continue;
 			}
 			ans += query(r + 1, m) - (m - r) * x;
 		}
 		
 		ans /= n, ans /= m;

 		cout << ans << "\n";
 		
 		return 0;
 	}

 	if (oka && !okb) {
 		swap(oka, okb);
 		swap(a, b);
 	}

 	if (!oka && okb) {
 		set<int> s;
 		for (auto [x, y] : a) {
 			s.insert(x);
 		}
 		for (auto [x, y] : b) {
 			s.insert(x);
 			s.insert(y);
 		}
 		vector<int> p(s.begin(), s.end());

 		vector<pair<int, int>> nb;
 		db L = 0;
 		for (int i = 1; i < p.size(); i++) {
 			int x = p[i - 1], y = p[i];
 			int l = -1, r = m;
 			while (l + 1 != r) {
 				int mid = (l + r) / 2;
 				if (b[mid].fi <= x) {
 					l = mid;
 				} else {
 					r = mid;
 				}
 			}
 			if (l == -1 || b[l].se < y) {
 				continue;
 			}
 			nb.push_back({x, y});
 			L += (y - x);
 		}
 		b = nb;
 		m = b.size();
 		vector<db> s1(m + 1), s2(m + 1);
 		for (int i = 1; i <= m; i++) {
 			s1[i] = s1[i - 1] + (b[i - 1].se - b[i - 1].fi);
 			s2[i] = s2[i - 1] + 1.0 * (b[i - 1].se - b[i - 1].fi) * (b[i - 1].fi + b[i - 1].se) / 2;
 		}
 		auto qry1 = [&](int ql, int qr) {
 			return s1[qr] - s1[ql - 1];
 		};
 		auto qry2 = [&](int ql, int qr) {
 			return s2[qr] - s2[ql - 1];
 		};
 		db ans = 0;
 		for (auto [x, y] : a) {
 			int l = -1, r = m;
 			while (l + 1 != r) {
 				int mid = (l + r) / 2;
 				if (b[mid].se <= x) {
 					l = mid;
 				} else {
 					r = mid;
 				}
 			}
 			if (l == -1) {
 				continue;
 			}
 			ans += x * qry1(1, l + 1) - qry2(1, l + 1);	
 		}
 		for (auto [x, y] : a) {
 			int l = -1, r = m;
 			while (l + 1 != r) {
 				int mid = (l + r) / 2;
 				if (b[mid].fi >= x) {
 					r = mid;
 				} else {
 					l = mid;
 				}
 			}
 			if (r == m) {
 				continue;
 			}
 			ans += qry2(r + 1, m) - x * qry1(r + 1, m);	
 		}

 		ans /= n;
 		ans /= L;
 	
 		cout << ans << "\n";
 		return 0;
 	}

 	set<int> s;
	for (auto [x, y] : a) {
		s.insert(x);
		s.insert(y);
	}
	for (auto [x, y] : b) {
		s.insert(x);
		s.insert(y);
	}

	vector<int> p(s.begin(), s.end());

	vector<pair<int, int>> na;
	vector<pair<int, int>> nb;
	
	db La = 0, Lb = 0;
	for (int i = 1; i < p.size(); i++) {
		int x = p[i - 1], y = p[i];
		int l = -1, r = m;
		while (l + 1 != r) {
			int mid = (l + r) / 2;
			if (a[mid].fi <= x) {
				l = mid;
			} else {
				r = mid;
			}
		}
		if (l == -1 || a[l].se < y) {
			continue;
		}
		na.push_back({x, y});
		La += (y - x);
	}
	for (int i = 1; i < p.size(); i++) {
		int x = p[i - 1], y = p[i];
		int l = -1, r = m;
		while (l + 1 != r) {
			int mid = (l + r) / 2;
			if (b[mid].fi <= x) {
				l = mid;
			} else {
				r = mid;
			}
		}
		if (l == -1 || b[l].se < y) {
			continue;
		}
		nb.push_back({x, y});
		Lb += (y - x);
	}

	a = na;
	n = a.size();
	b = nb;
	m = b.size();

	set<pair<int, int>> sb;
	for (auto [x, y] : b) {
		sb.insert({x, y});
	}

	vector<db> s1(m + 1), s2(m + 1);
	for (int i = 1; i <= m; i++) {
		s1[i] = s1[i - 1] + (b[i - 1].se - b[i - 1].fi);
		s2[i] = s2[i - 1] + 1.0 * (b[i - 1].se - b[i - 1].fi) * (b[i - 1].fi + b[i - 1].se) / 2;
	}

	auto qry1 = [&](int ql, int qr) {
		return s1[qr] - s1[ql - 1];
	};
	auto qry2 = [&](int ql, int qr) {
		return s2[qr] - s2[ql - 1];
	};
	
	db ans = 0;
	for (auto [x, y] : a) {
		if (sb.count({x, y})) {
			ans += 1.0 * (y - x) * (y - x) * (y - x) / 3;
		}
	}

	for (auto [x, y] : a) {
		int l = -1, r = m;
		while (l + 1 != r) {
			int mid = (l + r) / 2;
			if (b[mid].se <= x) {
				l = mid;
			} else {
				r = mid;
			}
		}
		if (l == -1) {
			continue;
		}
		ans += (y - x) * (0.5 * (x + y) * qry1(1, l + 1) - qry2(1, l + 1));	
	}
	for (auto [x, y] : a) {
		int l = -1, r = m;
		while (l + 1 != r) {
			int mid = (l + r) / 2;
			if (b[mid].fi >= y) {
				r = mid;
			} else {
				l = mid;
			}
		}
		if (r == m) {
			continue;
		}
		ans += (y - x) * (qry2(r + 1, m) - 0.5 * (x + y) * qry1(r + 1, m)) ;	
	}

	ans /= La, ans /= Lb;

	cout << ans << "\n";

    return 0;
}