#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k, b, ln = 0;
	cin >> n >> k >> b;
	vector <int> a (n, INT_MIN);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(a.begin(), a.end());
	a.push_back(INT_MAX);
	for (int i = 0; i < n+1; i++) {
		if (a[i] >= 0) {
			ln = i-1;
			break;
		}
	}
	

	if (ln < b-1) {
		cout << -1;
		return 0;
	}

	while (ln > b-1) {
		if (k <= 0) {
			cout << -1;
			return 0;
		}

		if (a[ln] < 0) {
			a[ln]++;
			k--;
		} else {
			ln--;
		}
	}

	if (ln%2 == 0) {
		int i = 0;
		while ((k > 0) && (i <= ln)) {
			if (a[i] <= k) {
				k -= (a[i]-1);
				a[i] = -1;
				i++;
			} else {
				a[i] -= k;
				k = 0;
			}
		}

		if (k > 0) {
			a[n-1] += k;
			k = 0;
		}
	}

	if (k > 0) {
		long long s = k;
		for (int i = ln+2; i < n+1; i++) {
			s += a[i-1];

			if (a[i] >= s/(i-(ln+1))) {
				long long d = s/(i-(ln+1)), r = s%(i-(ln+1));
				for (int j = ln+1; j < i; j++) {
					k -= (d-a[j]);
					a[j] += (d-a[j]);

					if (r > 0) {
						a[j]++;
						r--;
					}
				}

				break;
			}
		}
	}


	long long c = 1;
	for (int i = 0; i < n; i++) {
		c *= a[i];
		c = c % 1000000007;
	}
	cout << c;
	return 0;
}