//#define NDEBUG
#define _CRT_SECURE_NO_WARNINGS
#include <array>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <limits>
#include <memory>
#include <string>
#include <type_traits>

class rep {
	const std::size_t f, l;

public:
	using value_type = std::size_t;
	using reference = value_type;
	class repitr {
		friend rep;
		value_type i;
		repitr(value_type x) noexcept : i(x) {}

	public:
		void operator++() noexcept { ++i; }
		reference operator*() const noexcept { return i; }
		bool operator!=(const repitr x) const noexcept { return i != x.i; }
	};
	explicit rep(value_type first, value_type last) noexcept
		: f(first), l(last) {}
	repitr begin() const noexcept { return repitr(f); }
	repitr end() const noexcept { return repitr(l); }
};
class Rrep {
	const std::size_t f, l;

public:
	using value_type = std::size_t;
	using reference = value_type;
	class Rrepitr {
		friend Rrep;
		value_type i;
		Rrepitr(value_type x) noexcept : i(x) {}

	public:
		void operator++() noexcept { --i; }
		reference operator*() const noexcept { return i - 1; }
		bool operator!=(const Rrepitr x) const noexcept { return i != x.i; }
	};
	explicit Rrep(value_type first, value_type last) noexcept
		: f(first), l(last) {}
	Rrepitr begin() const noexcept { return Rrepitr(l); }
	Rrepitr end() const noexcept { return Rrepitr(f); }
};
template <class T> bool maxi(T &a, const T &b) {
	if (b < a)
		return 0;
	a = b;
	return 1;
}
template <class T> bool mini(T &a, const T &b) {
	if (a < b)
		return 0;
	a = b;
	return 1;
}
template <class T> bool smaxi(T &a, const T &b) {
	if (a < b) {
		a = b;
		return 1;
	}
	return 0;
}
template <class T> bool smini(T &a, const T &b) {
	if (b < a) {
		a = b;
		return 1;
	}
	return 0;
}
class customIO {
	int c;
	bool f;
	std::array<int, 30> buf;
	void get_c() { c = fgetc(stdin); }
	void put_c(int x) { fputc(x, stdout); }
	bool vacant() { return c == ' ' || c == '\n'; }
	operator int() { return 0; }

	// in

	void cueing() {
		while (get_c(), vacant())
			;
	}

public:
	template <class T>
	auto operator>>(T &d) ->
		typename std::enable_if<std::is_signed<T>::value, customIO &>::type {
		d = 0;
		f = 0;
		cueing();
		if (c == '-')
			f = 1, get_c();
		do
			d = d * 10 + c - '0';
		while (get_c(), !vacant());
		if (f)
			d = -d;
		return *this;
	}
	template <class T>
	auto operator>>(T &d) ->
		typename std::enable_if<!std::is_signed<T>::value, customIO &>::type {
		d = 0;
		cueing();
		do
			d = d * 10 + c - '0';
		while (get_c(), !vacant());
		return *this;
	}
	customIO &operator>>(char &d) {
		cueing();
		d = c;
		return *this;
	}
	customIO &operator>>(double &d) {
		scanf("%lf", &d);
		return *this;
	}
	customIO &operator>>(std::string &d) {
		d.clear();
		cueing();
		do
			d.push_back(c);
		while (get_c(), !vacant());
		return *this;
	}

	// out

	template <class T>
	auto operator<<(T d) ->
		typename std::enable_if<std::is_signed<T>::value, customIO &>::type {
		c = 0;
		f = 0;
		if (d < static_cast<T>(0))
			f = 1, d = -d;
		while (d)
			buf[c++] = d % 10 + '0', d /= 10;
		if (!c)
			buf[c++] = '0';
		if (f)
			put_c('-');
		while (c--)
			put_c(buf[c]);
		return *this;
	}
	template <class T>
	auto operator<<(T d) ->
		typename std::enable_if<!std::is_signed<T>::value, customIO &>::type {
		c = 0;
		while (d)
			buf[c++] = d % 10 + '0', d /= 10;
		if (!c)
			buf[c++] = '0';
		while (c--)
			put_c(buf[c]);
		return *this;
	}
	customIO &operator<<(char d) {
		put_c(d);
		return *this;
	}
	customIO &operator<<(const std::string &d) {
		for (const auto e : d)
			put_c(e);
		return *this;
	}
	customIO &operator<<(const char *d) {
		while (*d != '\0')
			put_c(*(d++));
		return *this;
	}
	customIO &operator<<(double d) {
		/*
		printf("%1.9f",d);
		/*/
		printf("%f", d);
		//*/
		return *this;
	}
	void endl() { put_c('\n'); }
	void space() { put_c(' '); }
} IO;
template <class T> T scan() {
	T ret;
	IO >> ret;
	return ret;
}

using int32 = std::int_fast32_t;
using int64 = std::int_fast64_t;
using uint32 = std::uint_fast32_t;
using uint64 = std::uint_fast64_t;
using intl32 = std::int_least32_t;
using intl64 = std::int_least64_t;
using uintl32 = std::uint_least32_t;
using uintl64 = std::uint_least64_t;

#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>;

int main() {
	const auto n = scan<uint32>(),k=scan<uint32>(),q=scan<uint32>();
	std::vector<uint32> a(n), b(n);
	for (auto &&e : a)
		IO >> e;
	std::iota(b.begin(), b.end(),0);
	std::sort(b.begin(), b.end(),
		[&](uint32 x, uint32 y) {return a[x] < a[y];});
	uint32 ans = UINT32_MAX;
	std::vector<char> use(n+1, 1);
	use[n] = 0;
	std::vector<uint32> ok, temp;
	for (const auto i : rep(0, n)) {
		uint32 last = 0;
		for (const auto j : rep(0, n+1)) {
			if (!use[j]) {
				if (j - last >= k) {
					for (const auto l : rep(last , j)) {
						temp.emplace_back(a[l]);
					}
					std::sort(temp.begin(), temp.end());
					for (const auto l : rep(0, j - last + 1 - k))
						ok.emplace_back(temp[l]);
					temp.clear();
				}
				last = j + 1;
			}
		}
		std::sort(ok.begin(), ok.end());
		if (ok.size() >= q)
			smini(ans, ok[q - 1] - ok[0]);
		ok.clear();
		use[b[i]] = 0;
	}
	IO << ans << '\n';
	return 0;
}

Measured memory_bytes: 384