use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn main() {
    input! {
        h: usize,
        w: usize,
        k: usize,
        t: usize,
        p: [(usize1, usize1, usize, i64); k],
    }
    if t >= h - 1 + w - 1 {
        println!("0");
        return;
    }
    let mut state = vec![vec![None; w]; h];
    for (x, y, c, d) in p {
        state[x][y] = Some((c, d));
    }
    let g = h - 1 + w - 1;
    let inf = std::i64::MAX / 2;
    let mut dp = vec![vec![vec![inf; 2 * g + 1]; w]; h];
    dp[0][0][g] = 0;
    let mut pq = std::collections::BinaryHeap::new();
    pq.push((0, 0, 0, g));
    let mut ans = inf;
    while let Some((d, x, y, k)) = pq.pop() {
        let d = -d;
        if d > dp[x][y][k] {
            continue;
        }
        for &(dx, dy) in [(1, 0), (0, 1), (!0, 0), (0, !0)].iter() {
            let x = x + dx;
            let y = y + dy;
            if x < h && y < w && k + 1 <= 2 * g && dp[x][y][k + 1].chmin(d) {
                pq.push((-d, x, y, k + 1));
            }
        }
        if let Some((a, b)) = state[x][y] {
            if k >= a - 1 {
                if dp[x][y][k - (a - 1)].chmin(d + b) {
                    pq.push((-(d + b), x, y, k - (a - 1)));
                }
            } else {
                ans.chmin(d + b);
            }
        }
    }
    for (x, dp) in dp.iter().enumerate() {
        for (y, dp) in dp.iter().enumerate() {
            for (k, dp) in dp.iter().enumerate() {
                if k + (h - 1 - x) + (w - 1 - y) <= t + g {
                    ans.chmin(*dp);
                }
            }
        }
    }
    if ans == inf {
        ans = -1;
    }
    println!("{}", ans);
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------
// ---------- begin chmin, chmax ----------
pub trait ChangeMinMax {
    fn chmin(&mut self, x: Self) -> bool;
    fn chmax(&mut self, x: Self) -> bool;
}

impl<T: PartialOrd> ChangeMinMax for T {
    fn chmin(&mut self, x: Self) -> bool {
        *self > x && {
            *self = x;
            true
        }
    }
    fn chmax(&mut self, x: Self) -> bool {
        *self < x && {
            *self = x;
            true
        }
    }
}
// ---------- end chmin, chmax ----------