#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 = 1; 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();
	sort(positives.begin(), positives.end());
	int check = 0;
	for (int i = 0; i < negatives.size() - neg - 1; ++i)
	{
		negatives[i] = negatives[i] + up;
		up = 0;
		if (negatives[i] - 1 > 0)
		{
			up = negatives[i] - 1;
			negatives[i] = 1;
		}
		if (negatives[i] < 0)
		{
			check = 1;
			break;
		}
	}
	if (check)
		cout << -1;
	up = zeros + up;
	if (up >= 0)
		zeros = 0;
	else
		zeros = 1;

	if (positives.size() >= 2)
	{
		while (up)
		{
			if (v[2] - v[1] == 0)
				v[1]++;
			else if (v[2] - v[1] < up)
			{
				up = up - v[2] + v[1];
				v[1] = v[2];
			}
			else
			{
				v[1] = v[1] + up;
				break;
			}
			sort(v.begin(), v.end());
		}
	}

	for (int)
}