#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>
#include<limits>
#include<bitset>
#include<functional>
#include<type_traits>
#include<array>
#include<queue>

namespace lib
{
	template<class T, class Comp>using p_queue = std::priority_queue<T, std::vector<T>, Comp>;

	template<std::uint64_t Mod>struct modnum;
	template<class T>constexpr T pow(T base, std::size_t p)
	{
		if (p == 0)
		{
			return T(1);
		}
		else if (p == 1)
		{
			return base;
		}
		else if (p == 2)
		{
			return base*base;
		}
		else if (p % 2 == 0)
		{
			return pow(pow(base, p / 2), 2);
		}
		else
		{
			return pow(pow(base, p / 2), 2)*base;
		}
	}
	template<std::uint64_t Mod>constexpr auto inverse(modnum<Mod> const&);

	template<std::uint64_t Mod>struct modnum
	{
		static constexpr auto mod = Mod;
		std::uint64_t val;
		modnum() = default;
		constexpr modnum(std::uint64_t v):val(v%Mod)
		{

		}

		constexpr modnum& operator+=(modnum const& v)
		{
			val += v.val;
			val %= mod;
			return *this;
		}
		constexpr modnum& operator-=(modnum const& v)
		{
			val += mod - v.val;
			val %= mod;
			return *this;
		}
		constexpr modnum& operator*=(modnum const& v)
		{
			val *= v.val;
			val %= mod;
			return *this;
		}
		constexpr modnum& operator/=(modnum const& v)
		{
			return operator*=(inverse(v));
		}
	};
	template<std::uint64_t Mod>constexpr auto operator+(modnum<Mod> lhs, modnum<Mod>const& rhs)
	{
		return lhs += rhs;
	}
	template<std::uint64_t Mod>constexpr auto operator+(modnum<Mod> lhs, int rhs)
	{
		return lhs += rhs;
	}
	template<std::uint64_t Mod>constexpr auto operator+(int lhs, modnum<Mod> rhs)
	{
		return rhs += lhs;
	}
	template<std::uint64_t Mod>constexpr auto operator-(modnum<Mod> lhs, modnum<Mod>const& rhs)
	{
		return lhs -= rhs;
	}
	template<std::uint64_t Mod>constexpr auto operator*(modnum<Mod> lhs, modnum<Mod>const& rhs)
	{
		return lhs *= rhs;
	}
	template<std::uint64_t Mod>constexpr auto operator*(modnum<Mod> lhs, int rhs)
	{
		return lhs *= rhs;
	}
	template<std::uint64_t Mod>constexpr auto operator*(int lhs, modnum<Mod> rhs)
	{
		return rhs *= lhs;
	}

	template<std::uint64_t Mod>constexpr auto operator/(modnum<Mod> lhs, modnum<Mod>const& rhs)
	{
		return lhs /= rhs;
	}

	template<std::uint64_t Mod>constexpr auto inverse(modnum<Mod>const& base)
	{
		return pow(base, Mod - 2);
	}

	template<class T>constexpr auto clamp(T v)
	{
		return std::max(v, T());
	}
	template<class T>void sort(std::vector<T>& vec)
	{
		std::sort(vec.begin(), vec.end());
	}
	template<class T, class Comp>void sort(std::vector<T>& vec, Comp&& comp)
	{
		std::sort(vec.begin(), vec.end(), std::forward<Comp>(comp));
	}

	template<class T>void vector_input(std::vector<T>& vec)
	{
		for (auto& v : vec)
		{
			std::cin >> v;
		}
	}

	template<class T>auto lower_bound(std::vector<T>const& vec, T v)
	{
		return std::distance(vec.begin(), std::lower_bound(vec.begin(), vec.end(), v));
	}
	template<class T>auto upper_bound(std::vector<T>const& vec, T v)
	{
		return std::distance(vec.begin(), std::upper_bound(vec.begin(), vec.end(), v));
	}

	struct scope_exit
	{
		std::function<void(void)> func;
		scope_exit(std::function<void(void)> f):func(f)
		{

		}
		~scope_exit()
		{
			func();
		}
	};

	template<int val>using int_tag = std::integral_constant<int, val>;
}

void Main();
int main()
{
	std::cin.tie(nullptr);
	std::cin.sync_with_stdio(false);
	Main();
}

void Main()
{
	int N, C, V;
	std::cin >> N >> C >> V;
	struct data_t
	{
		int start;
		int goal;
		int yen;
		int time;
	};
	std::map<int, std::map<int, std::set<std::pair<int, int>>>> data;
	std::vector<data_t> vec(V);
	for (int i{}; i < V; ++i)
	{
		std::cin >> vec[i].start;
	}
	for (int i{}; i < V; ++i)
	{
		std::cin >> vec[i].goal;
	}
	for (int i{}; i < V; ++i)
	{
		std::cin >> vec[i].yen;
	}
	for (int i{}; i < V; ++i)
	{
		std::cin >> vec[i].time;
	}
	for (auto const& v : vec)
	{
		data[v.start - 1][v.goal - 1].emplace(v.yen, v.time);
	}
	std::uint32_t memo[50][301] = {};
	for (int i{}; i < N; ++i)
	{
		for (int c{}; c <= C; ++c)
		{
			memo[i][c] = std::numeric_limits<std::uint32_t>::max();
		}
	}
	memo[0][C] = 0;
	for (int i{}; i < N; ++i)
	{
		for (int c{}; c <= C; ++c)
		{
			if (memo[i][c] == std::numeric_limits<std::uint32_t>::max())
			{
				continue;
			}
			for (auto const& m : data[i])
			{
				auto d = m.first;
				for (auto const& p : m.second)
				{
					if (c < p.first)
					{
						break;
					}
					memo[d][c - p.first] = std::min(memo[d][c - p.first], memo[i][c] + p.second);
				}
			}
		}
	}
	std::uint32_t min = std::numeric_limits<std::uint32_t>::max();
	for (int c{}; c <= C; ++c)
	{
		min = std::min(min, memo[N - 1][c]);
	}
	std::cout << static_cast<int>(min) << std::endl;
}