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

int dp[1002][1002],inf = 1001001001;

int main() {
    int N,M;
    cin >> N >> M;
    vector<int>A(N+1),B(M+1);
    for(int i = 0; i < N; i++) {
        cin >> A[i];
    }
    for(int i = 0; i < M; i++) {
        cin >> B[i];
    }
    for(int i = 0; i < N; i++) {
        A[i+1] += A[i];
    }
    for(int i = 0; i < M; i++) {
        B[i+1] += B[i];
    }
    for(int i = 0; i <= N; i++) {
        for(int j = 0; j <= M; j++) {
            dp[i][j] = inf;
        }
    }
    dp[0][0] = 0;
    for(int i = 0; i < N; i++) {
        for(int j = 0; j < M; j++) {
            dp[i+1][j] = min(dp[i+1][j],dp[i][j]+1);
            dp[i][j+1] = min(dp[i][j+1],dp[i][j]+1);
            dp[i+1][j+1] = min(dp[i+1][j+1],max(dp[i][j],abs(A[i]-B[j])));
        }
    }
    cout << dp[N][M] << endl;
}