#include <iostream>
#include <vector>
#include <algorithm>
#define int long long
#define MOD % 1'000'000'007
using namespace std;

signed main() {
	int N, M, b;
	cin >> N >> M >> b;
	//vector<int> A(N);
	vector<int> p, n;
	int zc = 0;
	//int mini = 0, maxi = 0;
	//int sn = 0;
	for (int i = 0, a; i < N; i++) {
		cin >> a;
		if (a < 0) n.push_back(a);
		else if (a > 0) p.push_back(a);
		else zc++;

		//if (A[maxi] > a) maxi = i;
		//if (A[mini] < a) mini = i;
		//if (a < 0) sn+=-a;
	}
	sort(n.begin(), n.end());
	
	while (b != n.size()) {
		M += n[n.size()-1];
		n.pop_back();
		//p.push_back(0);
		zc++;
	}
	int s, i;
	if (M < 0) {
		cout << -1 << endl;
		return 2;
	}
	if (M == 0) goto end;
	if (zc > M) goto end;
	M -= zc;
	while (zc--) p.push_back(1);
	//cout << "zc=" << zc << "; M=" << M << "\n";
	
	sort(p.begin(), p.end());
	while (M) {
		int i = 1;
		p[0]++;
		M--;
		while (M && i<p.size() && p[i] <= p[i - 1]) {
			p[i]++;
			M--;
			i++;
		}
	}

	end:
	if (zc > 0) {
		cout << 0 << endl;
		return 1;
	}
	//for (int& i : p) cout << i << "; ";
	//cout << "\n";
	int o = 1;
	for (int& i : p) o = o * i MOD;
	for (int& i : n) o = o * i MOD;
	cout << o << endl;
	return 0;
}