#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i ++)
#define per(i, r, l) for(int i = (r); i >= (l); i --)
#define trv(i, u, v) for(int i = head[u], v = e[i].to; i; v = e[i = e[i].nxt].to)
#define fi first
#define se second
#define all(s) s.begin(), s.end()
#define sz(s) (int)(s.size())
#define lb(s) ((s) & -(s))
#define pb push_back
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
mt19937_64 hua(time(0));
template<typename T> inline bool chkmx(T &x, T y) {return x < y ? x = y, 1 : 0;}
template<typename T> inline bool chkmn(T &x, T y) {return y < x ? x = y, 1 : 0;}
template<int T> using A = array<int, T>;

inline int read() {
	int x = 0, f = 1; char c = getchar();
	for(; !isdigit(c); c = getchar()) if(c == '-')  f = 0;
	for(; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	return f ? x : -x;
}
const int maxn = 1e5;
const int inf = 1e9;
int n, m, a[maxn + 5], b[maxn + 5], c[maxn + 5], d[maxn + 5];
int x[maxn + 5], y[maxn + 5];
ll ans;
void solve() {
	rep(i, 1, n) x[i] = a[i] - c[i];
	rep(i, 1, m) y[i] = d[i] - b[i];
	sort(y + 1, y + m + 1);
	rep(i, 1, n) {
		int cnt = y + m + 1 - lower_bound(y + 1, y + m + 1, x[i]);
		ans += 1ll * a[i] * cnt;
	}
	
	
	rep(i, 1, m) x[i] = b[i] - d[i];
	rep(i, 1, n) y[i] = c[i] - a[i];
	sort(y + 1, y + n + 1);
	rep(i, 1, m) {
		int cnt = y + n + 1 - lower_bound(y + 1, y + n + 1, x[i]);
		ans += b[i] * cnt;
	}
	
	rep(i, 1, n) swap(a[i], c[i]);
	rep(i, 1, m) swap(b[i], d[i]);
	rep(i, 1, n) x[i] = a[i] - c[i];
	rep(i, 1, m) y[i] = d[i] - b[i];
	sort(y + 1, y + m + 1);
	rep(i, 1, n) {
		int cnt = y + m + 1 - upper_bound(y + 1, y + m + 1, x[i]);
		ans += 1ll * a[i] * cnt;
	}
	
	rep(i, 1, m) x[i] = b[i] - d[i];
	rep(i, 1, n) y[i] = c[i] - a[i];
	sort(y + 1, y + n + 1);
	rep(i, 1, m) {
		int cnt = y + n + 1 - upper_bound(y + 1, y + n + 1, x[i]);
		ans += b[i] * cnt;
	}
}
int main() {
	//freopen("in.txt", "r", stdin);
	n = read(), m = read();
	rep(i, 2, n) a[i] = read(); a[1] = inf;
	rep(i, 1, m) b[i] = read();
	rep(i, 1, n) c[i] = read();
	rep(i, 2, m) d[i] = read(); d[1] = inf;
	solve();
	cout << ans - min(a[1] + b[1], c[1] + d[1]) << '\n'; 
	return 0;
}