#include<iostream>

#include<cstring>

#include<algorithm>

#include<cstdio>

#include<cstdlib>

using namespace std;

const int N=;

int l,r,x1[N],x2[N];

int L,R,idl,idr;

void init()

{

    R=L=;

    for (int i=l;i<=r;i += )

    {

        if (i<)

        {

            scanf("%d", &x1[(-i)/]);

            if (L <= x1[(-i)/]) {

                L = x1[(-i)/]; idl = (-i)/;

            }

        } else {

            scanf("%d", &x2[i/]);

            if (R < x2[i/]) {

                R = x2[i/]; idr = i/;

            }

        }

    }

}

int del(int a, int b) {

    if (a <= b) return  * a;

    else return a + b;

}

int solve() {

    l = (-l) / ; r = r / ;

    if (R == L) {

        int k = , t = ;

        int tmp = x1[l];

        for (int i = l; i > idl; i--) {

            k += tmp; tmp = max(tmp, x1[i-]);

        }

        tmp = x2[r];

        for (int i = r; i > idr; i--) {

            t += tmp; tmp = max(tmp, x2[i-]);

        }

        return (idl + idr + ) * R *  + min(k, t) *  * ;

    } else {

        int T = min(R, L);

        int p = , q = , k = , t = ;

        while (p < l && x1[p] < T) p++;

        while (q < r && x2[q] < T) q++;

        if (R > L) {

            int tmp = x2[q];

            for (int i = q; x2[i] <= L; i++) {

                k += tmp; tmp = max(tmp, x2[i+]);

            }

            tmp = x1[l];

            for (int i = l; i > p; i--) {

                t += tmp; tmp = max(tmp, x1[i-]);

            }

        } else {

            int tmp = x1[p];

            for (int i = p; x1[i] <= R; i++) {

                k += tmp; tmp = max(tmp, x1[i+]);

            }

            tmp = x2[r];

            for (int i = r; i > q; i--) {

                t += tmp; tmp = max(tmp, x2[i-]);

            }

        }

        int ans = t > k ? t + k :  * t;

        return ans *  + (p + q + ) * T * ;

    }

}

int main()

{

    while (scanf("%d%d", &l, &r) ==  && l && r)

    {

        init();

        printf("%d\n", solve());

    }

    return ;

}