#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD=1e9+7;
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n,k,b; cin>>n>>k>>b;
    vector<int> pos,neg;
    for(int i=0; i<n; i++)
    {
        int x; cin>>x;
        if(x<0) neg.push_back(x);
        else pos.push_back(x);
    }
    if(neg.size()<b)
    {
        cout<<"-1\n";
        return 0;
    }
    sort(neg.begin(),neg.end());
    int op=0;
    priority_queue<int> q;
    for(int &i:pos)
        q.push(-i);
    for(int i=b; i<neg.size(); i++)
    {
        op+=abs(neg[i]);
        q.push(0);
    }
    if(op>k)
    {
        cout<<"-1\n";
        return 0;
    }
    k-=op;
    while(k--)
    {
        int x=q.top();
        q.pop();
        x=abs(x);
        x++;
        q.push(-x);
    }
    int ans=1;
    while(!q.empty())
    {
        int x=q.top();
        q.pop();
        x=abs(x);
        ans=ans*x%MOD;
    }
    for(int i=0; i<b; i++)
        ans=ans*abs(neg[i])%MOD;
    cout<<ans<<"\n";
}