#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];
void calc_dp(vector<Item>& cross, ll val[], ll dp[]){
FOR(i, 1, n + m - 1){
pref[i] = pref[i - 1] + val[i];
}
FOR(i, 1, n + m - 1){
int curL = INT_MIN; ll sum = 0;
FOR(j, 1, sz(cross) - 1){
if(cross[j].l <= i){
curL = max(curL, cross[j].l);
sum = sum + cross[j].c;
}
}
if(curL == INT_MIN){
dp[i] = dp[i - 1] + val[i];
continue;
}
dp[i] = INF;
FOR(j, curL, i){
dp[i] = min(dp[i], dp[j - 1] + sum);
dp[i] = min(dp[i], dp[j - 1] + (pref[i] - pref[j - 1]));
}
}
//cout << "END DP\n";
return;
}
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;
}
calc_dp(cross[1], val[1], dp[1]);
calc_dp(cross[0], val[0], dp[0]);
cout << dp[0][n + m - 1] + dp[1][n + m - 1] << "\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;
}
