use std::collections::BTreeMap;

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)*}
    };
}

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)*}
    };
}

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, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

fn main() {
    input! {
        n: usize,
        m: usize,
        a: [i64; n],
        b: [i64; m],
        c: [i64; n],
    }

    let v = {
        let mut v = vec![0];
        for i in 0..(n - 1) {
            v.push(v[i] + b[i % m]);
        }
        v
    };

    let mut set = BTreeMap::new();
    for i in 0..n {
        set.insert(a[i] - v[i], set.get(&(a[i] - v[i])).unwrap_or(&0) + c[i]);
    }

    let sum = c.iter().sum::<i64>();
    let minus = *set
        .iter()
        .map(|(_, &v)| v)
        .collect::<Vec<_>>()
        .iter()
        .max()
        .unwrap();

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