#[allow(unused_macros)]
macro_rules! input_byline {
    ($($r:tt)* ) => {
        let stdin = std::io::stdin();
        let mut q = std::collections::VecDeque::new();
        let mut next = || {
            if q.is_empty() {
                let mut s = String::new();
                stdin.read_line(&mut s);
                for v in s.split_whitespace() {
                    q.push_back(v.to_string());
                }
            }
            q.pop_front().unwrap()
        };
        input_inner!{next, $($r)*}
    };

}

#[allow(unused_macros)]
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

trait Printable {
    fn p(&self);
}

impl<T: std::fmt::Display> Printable for T {
    fn p(&self) {
        println!("{}", self);
    }
}

impl<T: std::fmt::Display> Printable for [T] {
    fn p(&self) {
        for i in 0..self.len() {
            if i != 0 {
                print!(" ");
            }
            print!("{}", self[i]);
        }
        println!("");
    }
}

#[allow(unused_imports)]
use std::cmp::{max, min};
#[allow(unused_imports)]
use std::collections::{BinaryHeap, HashMap};

#[allow(dead_code)]
type Graph = Vec<Vec<usize>>;

struct Combination {
    modp: usize,
    mfact: Vec<usize>,
    rfact: Vec<usize>,
}

impl Combination {
    fn new(size: usize, modp: usize) -> Self {
        let mut rfact = vec![0; size + 1];
        let mut mfact = vec![0; size + 1];
        mfact[0] = 1;
        for i in 1..mfact.len() {
            mfact[i] = (mfact[i - 1] * i) % modp;
        }
        rfact[size] = Self::inv(mfact[size], modp);
        for i in (0..size).rev() {
            rfact[i] = rfact[i + 1] * (i + 1) % modp;
        }

        Combination {
            modp: modp,
            mfact: mfact,
            rfact: rfact,
        }
    }

    fn pow(mut x: usize, mut n: usize, modp: usize) -> usize {
        let mut ret = 1;
        while n > 0 {
            if n & 1 > 0 {
                ret *= x;
                ret %= modp;
            }
            x *= x;
            x %= modp;
            n >>= 1;
        }
        ret
    }

    fn inv(x: usize, modp: usize) -> usize {
        Self::pow(x, modp - 2, modp)
    }

    fn C(&self, p: usize, q: usize) -> usize {
        if p < q {
            return 0;
        }
        (((self.mfact[p] * self.rfact[q]) % self.modp) * self.rfact[p - q]) % self.modp
    }
}

const M: usize = 1e9 as usize + 7;

fn main() {
    input! {
        n: usize,
        m: usize,
        x: [i64; n],
        y: [i64; m],
    }

    let mut xsum = 0;
    for i in 0..n - 1 {
        let mut s = x[i + 1] - x[i];
        let i = i as i64;
        s *= i + 1;
        s *= n as i64 - i - 1;

        xsum += s;
        xsum %= M as i64;
    }

    let mut sum = 0;
    for i in 0..m - 1 {
        let mut s = y[i + 1] - y[i];
        let i = i as i64;
        s *= i + 1;
        s *= m as i64 - i - 1;
        s %= M as i64;

        sum += xsum * s;
        sum %= M as i64;
    }

    println!("{}", sum);
}


Measured memory_bytes: 6396