#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define gcd __gcd
#define sz(v) (int) v.size()
#define pb push_back
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define compact(v) (v).erase(unique(all(v)), (v).end())
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define REV(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) "[" #x " = " << (x) << "]"
///#define int long long
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template<typename T> bool ckmx(T& a, const T& b){if(a < b) return a = b, true; return false;}
template<typename T> bool ckmn(T& a, const T& b){if(a > b) return a = b, true; return false;}
const int N = 2e5+5;
const ll MOD = 1e9+7;
const ll INF = 1e18;
struct Item{
int l, r; ll c;
Item(int l = -1, int r = -1, ll c = 0): l(l), r(r), c(c) {}
};
ll n, m, val[2][N], dp[2][N], pref[N];
vector<Item> cross[2];
ll calc_dp(vector<Item>& cross, ll val[], ll dp[]){
FOR(i, 1, n + m - 1){
pref[i] = val[i];
pref[i] += pref[i - 1];
}
ll answer = pref[n + m - 1];
FOR(i, 1, n + m - 1){
ll sum = 0;
vector<ll> lazy(n + m + 2);
FOR(j, 1, sz(cross) - 1){
if(cross[j].l <= i && i <= cross[j].r){
sum += cross[j].c;
lazy[1] += cross[j].c;
lazy[cross[j].l] -= cross[j].c;
// dp[l] already has cross[j].c
}
}
dp[i] = sum + pref[i - 1];
FOR(j, 1, i - 1){
dp[i] = min(dp[i], dp[j] + lazy[j] +
pref[i - 1] - pref[j]);
lazy[j + 1] += lazy[j];
}
//cout << dp[i] <<" ";
answer = min(answer, dp[i] + pref[n + m - 1] - pref[i]);
}
//cout << pref[n + m - 1] << "\n";
//cout << "END DP\n";
return answer;
}
void solve()
{
cin >> m >> n;
cross[0].push_back(Item());
cross[1].push_back(Item());
FOR(i, 1, m + n - 1){
int l,r;
if(i <= n){
l = n - i + 1;
}
else l = i - n + 1;
if(i <= m){
r = n + i - 1;
}
else r = n + m - 1 - (i - m);
int cur_w; cin >> cur_w;
cross[(i & 1)].push_back(Item(l, r, cur_w));
}
FOR(i, 1, m + n - 1){
int cur_w; cin >> cur_w;
if((i & 1) == (n & 1)){
val[1][i] = cur_w;
}
else val[0][i] = cur_w;
}
ll answer = calc_dp(cross[1], val[1], dp[1]) + calc_dp(cross[0], val[0], dp[0]);
//cout << calc_dp(cross[1], val[1], dp[1]) << "\n";
//cout << calc_dp(cross[0], val[0], dp[0]) << "\n";
cout << answer << "\n";
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#define name "InvMOD"
if(fopen(name".INP", "r")){
freopen(name".INP","r",stdin);
freopen(name".OUT","w",stdout);
}
int t = 1; //cin >> t;
while(t--) solve();
return 0;
}
/* Test
Input:
4 3
5 3 4 3 5 3
5 2 5 2 4 2
Output: 19
Input:
3 3
4 1 2 2 3
4 1 2 1 4
Output: 6
*/
