#include <stdio.h>
#include <stdlib.h>

int main(void) {
    int n, m, i, x_offset, y_offset, tmp;
    int *x_freq, *y_freq;
    long long *x, *y, **area, sum = 0;
    scanf("%d %d", &n, &m);
    x = malloc(n * sizeof(long long));
    x_freq = malloc(n * sizeof(int));
    y = malloc(m * sizeof(long long));
    y_freq = malloc(n * sizeof(int));
    area = malloc(n * sizeof(long long *));

    for (i = 0; i < n; i++) {
        area[i] = malloc(m * sizeof(long long));
    }
    for (i = 0; i < n; i++) {
        scanf("%lld", &x[i]);
    }
    for (i = 0; i < m; i++) {
        scanf("%lld", &y[i]);
    }

    for (x_offset = 0; x_offset < n - 1; x_offset++) {
        for (y_offset = 0; y_offset < m - 1; y_offset++) {
            area[x_offset][y_offset] = (x[x_offset + 1] - x[x_offset]) * (y[y_offset + 1] - y[y_offset]);
        }
    }

    x_freq[0] = x_freq[n - 2] = n - 1;
    tmp = n - 1;
    for (i = 1; i < (n - 1) / 2; i++) {
        tmp -= 2;
        x_freq[i] = x_freq[n - i - 2] = x_freq[i - 1] + tmp;
    }
    if ((n - 1) % 2) {
        x_freq[n / 2 - 1] = x_freq[n / 2] + 1;
    }
    y_freq[0] = y_freq[m - 2] = m - 1;
    tmp = m - 1;
    for (i = 1; i < (m - 1) / 2; i++) {
        tmp -= 2;
        y_freq[i] = y_freq[m - i - 2] = y_freq[i - 1] + tmp;
    }
    if ((m - 1) % 2) {
        y_freq[m / 2 - 1] = y_freq[m / 2] + 1;
    }

    for (x_offset = 0; x_offset < n - 1; x_offset++) {
        for (y_offset = 0; y_offset < m - 1; y_offset++) {
            sum += area[x_offset][y_offset] * x_freq[x_offset] * y_freq[y_offset];
            sum = sum % 1000000007;
        }
    }

    printf("%lld\n", sum);
    return 0;
}