#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;
	cerr << index;
	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);
	}
	bool ugras = 0;
	for(int i = jindex; k > 0; i++){
		//v[i]++;
		//k--;
		//cout << v[i] << ' ';
		while(v[i] <= v[i+1] && k > 0){
			v[i]++;
			k--;
			ugras = 1;
		}
		if(ugras){
			ugras = 0;
			i = jindex;
		}
		
	}
	long long ans = 1;
	for(int i = 0; i < n; i++){
		ans *= abs(v[i]) % MOD;
		ans %= MOD;
		//cout << v[i] << ' ';
	}
	
	cout << ans;
	
}