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

int main() {
	int h, w;
	cin >> h >> w;

	vector<int> as(h, 0), bs(w, 0), cs(h, 0), ds(w, 0);
	for (int y = 1; y < h; ++y) cin >> as[y];
	for (int x = 0; x < w; ++x) cin >> bs[x];
	for (int y = 0; y < h; ++y) cin >> cs[y];
	for (int x = 1; x < w; ++x) cin >> ds[x];

	ll res = 0;
	for (int y = 1; y < h; ++y) res += as[y] + bs[0];
	for (int x = 1; x < w; ++x) res += cs[0] + ds[x];
	
	ll sum_bs = 0;
	for (int x = 1; x < w; ++x) sum_bs += bs[x];
	for (int y = 1; y < h; ++y) res += sum_bs + as[y] * (w-1);

	vector<ll> xs(h - 1), ys(w-1);
	for (int y = 1; y < h; ++y) xs[y-1] = cs[y] - as[y];
	for (int x = 1; x < w; ++x) ys[x-1] = ds[x] - bs[x];
	
	sort(ys.rbegin(), ys.rend());
	ys.push_back(0);
	for (int x = w-1; x >= 0; --x) ys[x] += ys[x+1];

	for (ll x : xs) {
		int low = 0;
		int high = w - 1;
		while(low != high) {
			int mid = (low + high) >> 1;
			ll y = ys[mid] - ys[mid + 1];
			if (x + y <= 0) high = mid;
			else low = mid + 1;
		}
		res += x * (w-1 - high) + ys[high];
	}
	cout << res << '\n';
}