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

using namespace std;

int n, up, neg, zeros;

vector<int> negatives, positives;

int main()
{
	cin >> n >> up >> neg;
	int mini = INT_MAX, t;
	for (int i = 0; i < n; ++i)
	{
		cin >> t;
		if (t < 0)
			negatives.push_back(t);
		else if (t == 0)
			zeros--;
		else
			positives.push_back(t);
	}
	sort(negatives.begin(), negatives.end());
	int negs = negatives.size();
	
	int check = 0;
	for (int i = (int)negatives.size() - neg - 1; i >= 0; --i)
	{
		negatives[i] = negatives[i] + up;
		up = 0;
		if (negatives[i] - 1 > 0)
		{
			up = negatives[i] - 1;
			negatives[i] = 1;
			positives.push_back(1);
		}
		if (negatives[i] < 0)
		{
			check = 1;
			break;
		}
	}
	if (check || neg > negatives.size())
		cout << -1;
	else
	{
		if (zeros + up < 0)
			cout << 0;
		else
		{
			for (int i = zeros; i < 0; ++i)
				positives.push_back(1);
			up = zeros + up;
			
			if (positives.size() >= 2)
			{
				while (up)
				{
					sort(positives.begin(), positives.end());
					if (positives[1] - positives[0] == 0)
					{
						positives[0]++;
						up--;
					}
					else if (positives[1] - positives[0] < up)
					{
						up = up - positives[1] + positives[0];
						positives[0] = positives[1];
					}
					else
					{
						positives[0] = positives[0] + up;
						up = 0;
						break;
					}
				}
			}
			int s = 1;
			for (auto& e : positives)
				s = s * (e % 1000000007);
			for (auto& e : negatives)
				s = s * (e % 1000000007);
			cout << s;
		}
		
	}
}