#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int n, k, b, a;
int m = 1000000007;

vector<int> v;

void meg() {
	int res = 1;
	for (auto& e : v)
	{
		res = res * e % m;
	}
	cout << res;
}

void fix() {
	if (n >= 2)
	{
		int i = 1;
		while (k)
		{
			if (v[i - 1] >= 0)
			{
				if (v[i - 1] <= v[i])
				{
					v[i - 1]++;
					k--;
				}
				else if (i < v.size() - 1)
					i++;
				else
					break;
			}
			else
				i++;
		}
	}
	else
	{
		v[0] = v[0] + k;
		k = 0;
	}
}

int main() {
	cin >> n >> k >> b;
	for (int i = 1; i <= n; ++i)
	{
		cin >> a;
		v.push_back(a);
	}
	sort(v.begin(), v.end());
	if ((v[0] >= 0 && b > 0))
		cout << -1;
	else if (v[0] >= 0)
	{
		while (k)
		{
			fix();
			sort(v.begin(), v.end());
		}
		meg();
	}
	else if (v[0] < 0 && b == 0)
	{
		int i = 1;
		for (auto i = v.rbegin(); i != v.rend(); ++i)
		{
			if (*i < 0)
			{
				k = k + *i;
				*i = 0;
			}
		}
		if (k < 0)
			cout << -1;
		else if (k == 0)
			cout << 0;
		else
		{
			while (k)
			{
				fix();
				sort(v.begin(), v.end());
			}
			meg();
		}

	}
	else if (v[0] < 0 && b > 0 && b % 2 == 0)
	{
		int i = 1, db = 0, t = 0;
		for (auto i = v.rbegin(); i != v.rend() && t - db > b; ++i)
		{
			if (*i < 0)
			{
				k = k + *i;
				*i = 0;
				db++;
				if (!t)
					t = distance(v.rend(), i);
			}
		}
		if (k < 0)
			cout << -1;
		else if (k == 0)
			cout << 0;
		else
		{
			while (k)
			{
				fix();
				sort(v.begin(), v.end());
			}
			meg();
		}
	}
}