#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <math.h>

using namespace std;

long long m = 1e9 + 7;

int main()
{
	iostream::sync_with_stdio(0);
	cin.tie(0);

	int n, k, b, i;
	cin >> n >> k >> b;

	int startnegatives = 0;
	vector<long long> a(n);
	for (i = 0; i < n; i++)
	{
		cin >> a[i];
		if (a[i] < 0) startnegatives++;
	}
	if (startnegatives < b)
	{
		cout << -1;
		return 0;
	}

	sort(a.begin(), a.end());
	int firstnonneg = 0;
 	while (firstnonneg == n - 1 || (firstnonneg < n-1 && a[firstnonneg] < 0)) firstnonneg++;
	for (int i = b; i < firstnonneg; i++)
	{
		k += a[i];
		a[i] = 0;
	}
	if (k < 0)
	{
		cout << -1;
		return 0;
	}
	firstnonneg = b;

	if (b < n)
	{
		i = firstnonneg;
		while (k > 0)
		{
			a[i]++;
			k--;
			if (i == n - 1 || a[i] <= a[i + 1]) i = firstnonneg;
			else i++;
		}
	}
	else
	{
		i = 0;
		while (k > 0)
		{
			if (++a[i] == 0)
			{
				cout << -1;
				return 0;
			}
			k--;
			if (i == n - 1 || a[i] >= a[i + 1]) i = 0;
			else i++;
		}
	}

	long long product = 1;
	for (i = 0; i < n; i++)
	{
		product = (product * a[i]) % m;
	}
	cout << product;
}
//6 2 6
//-1 -2 -1 -2 -3 -1