#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

const long long MOD = 1000000007;

int main() {
	int n,k,b; cin >> n >> k >> b;
	vector <long long> v(n,0);
	int neg = 0;
	for(int i = 0; i < n; i++){
		cin >> v[i];
		if(v[i] < 0){
			neg++;
		}
	}
	sort(v.begin(),v.end());
	int index = lower_bound(v.begin(),v.end(),0) - v.begin();
	int jindex = index;
	bool vege = 0;
	for(int i = index; k > 0; i--){
		if(neg <= b){
			vege = 1;
			jindex = i;
			break;
		}
		while(v[i] < 0 && k > 0){
			v[i]++;
			k--;
		}
		neg--;
		
	}

	if(!vege){
		cout << -1;
		exit(0);
	}
	vege = 0;
	bool ugras = 0;
	int j = jindex + 1;
	while(k > 0){
		for(int i = jindex; i < j; i++){
			while(v[i] <= v[j] && k > 0){
				v[i]++;
				k--;
				if(v[i] > v[i+1]){
					i++;
				}
			}
			
			if(k == 0){
				vege = 1;
				break;
			}
		}
		if(vege)	break;
		j++;
	}

	long long ans = 1;
	for(int i = 0; i < n; i++){
		ans *= abs(v[i]) % MOD;
		ans %= MOD;
	}
	
	cout << ans;
	
}