#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = (int) 1e3 + 7; const ll INF = (ll) 1e18; ll dp[N][N], a[N], b[N]; int w, h; signed main() { ios::sync_with_stdio(0); cin.tie(0); /// freopen("input", "r", stdin); cin >> w >> h; for (int i = 1; i <= w; i++) { cin >> a[i]; } for (int i = 1; i <= h; i++) { cin >> b[i]; } for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { dp[i][j] = INF; } } dp[1][1] = 0; for (int i = 1; i <= w; i++) { for (int j = 1; j <= h; j++) { if (i == 1 && j == 1) { continue; } dp[i][j] = min(dp[i - 1][j] + b[j], dp[i][j - 1] + a[i]); } } cout << dp[w][h]; return 0; }