def main
  n = gets.to_i
  c = gets.to_i
  v = gets.to_i
  s = gets.split.map(&:to_i)
  t = gets.split.map(&:to_i)
  y = gets.split.map(&:to_i)
  m = gets.split.map(&:to_i)
  ways = []
  v.times do |i|
    ways << { s: s[i], t: t[i], y: y[i], m: m[i] }
  end
  ways_from = ways.group_by { |way| way[:s] }
  queue = [{ pos: 1, cost: c, time: 0 }]
  result = nil

  until queue.empty?
    queue.sort_by! { |q| q[:time] }

    cur = queue.shift
    if n == cur[:pos]
      result = cur
      break
    end

    ways_from[cur[:pos]].each do |nxt|
      next if cur[:cost] < nxt[:y]

      queue << { pos: nxt[:t], cost: cur[:cost] - nxt[:y], time: cur[:time] + nxt[:m] }
    end
  end

  result.present? ? result[:time] : -1
end

puts main