#nullable enable

#region
var (_input, _iter) = (Array.Empty<string>(), 0);
T I<T>() where T : IParsable<T>
{
    while (_iter >= _input.Length) (_input, _iter) = (Console.ReadLine()!.Trim().Split(' '), 0);
    return T.Parse(_input[_iter++], null);
}
#endregion

static T[] Range<T>(int n, Func<T> F) => Enumerable.Range(0, n).Select(_ => F()).ToArray();

long Solve()
{
    var n = I<int>();
    var m = I<int>();
    var saz = new long[n + 1];
    for (var i = 1; i <= n; i++) saz[i] = saz[i - 1] + I<int>();
    var sbz = new long[m + 1];
    for (var i = 1; i <= m; i++) sbz[i] = sbz[i - 1] + I<int>();
    var w = n + m;
    var caz = Range(w, () => new List<int>());
    var cbz = Range(w, () => new List<int>());
    for (var i = 0; i < n; i++) caz[I<int>() - 1].Add(i);
    for (var i = 0; i < m; i++) cbz[I<int>() - 1].Add(i);
    var res = -1L;
    for (var c = 0; c < w; c++)
    {
        for (var lp = 0; lp < 2; lp++)
        {
            var l = -1;
            var r = w;
            foreach (var ia in caz[c])
            {
                if (ia <= n - 1 - ia) l = Math.Max(l, ia);
                if (ia >= n - 1 - ia) r = Math.Min(r, ia);
            }
            long L(int ia, int ib)
            {
                var la = Math.Min(ia, n - 1 - ia);
                var lb = Math.Min(ib, m - 1 - ib);
                var len = Math.Min(la, lb);
                var sa = saz[ia + len + 1] - saz[ia - len];
                var sb = sbz[ib + len + 1] - sbz[ib - len];
                return sa + sb;
            }
            foreach (var ib in cbz[c])
            {
                if (l >= 0) res = Math.Max(res, L(l, ib));
                if (r < n) res = Math.Max(res, L(r, ib));
            }
            (n, m) = (m, n);
            (saz, sbz) = (sbz, saz);
            (caz, cbz) = (cbz, caz);
        }
    }
    return res;
}
var ans = Range(I<int>(), Solve);
Console.WriteLine(string.Join(Environment.NewLine, ans));