// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

int pow(int a, int b){
    if(b==0)return 1;
    if(b%2)return (pow(a,b-1)*a)%(int)(1e9+7);
    int x=pow(a,b/2);
    return (x*x)%(int)(1e9+7);
}

signed main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL);
    int n,k,b;cin>>n>>k>>b;
    vector<int> neg,poz,null;
    for(int i = 0;i<n;i++){
        int a;cin>>a;
        if(a==0)null.push_back(a);
        else if(a>0)poz.push_back(a);
        else neg.push_back(a);
    }
    sort(neg.begin(),neg.end());
    sort(poz.rbegin(),poz.rend());
    int sum=0,ans=1;
    for(int i = neg.size()-1;i>=0;i--){
        if(i>=b)sum+=-neg[i];
        else ans=(ans*neg[i])%(int)(1e9+7);
    }
    if(sum>k||neg.size()<b){
        cout<<-1<<endl;
        return -1;
    }
    k-=sum;
    if(null.size()+neg.size()-b>k){
        cout<<0<<endl;
        return -1;
    }
    k-=(null.size()+neg.size()-b);
    for(int i = 0;i<null.size()+neg.size()-b;i++){
        poz.push_back(1);
    }
    int currn=0,currdb=0;
    if(poz.size()>0)currn=poz[0],currdb=1;
    set<pair<int,int>> s;
    for(int i = 1;i<poz.size();i++){
        if(currn!=poz[i]){
            s.insert({currn,currdb});
            currn=poz[i];
            currdb=1;
        }
        else currdb++;
    }
    if(poz.size()>0)s.insert({currn,currdb});
    //for(auto[a,b]:s)cout<<a<<' '<<b<<endl;
    while(k>0){
        auto [A,B]=*s.begin();
        if(B<=k){
            s.erase({A,B});
            auto it=s.lower_bound({A+1,0});
            pair<int,int> i=*it;
            if(it!=s.end()&&i.first==A+1){
                s.erase({i});
                s.insert({A+1,B+i.second});
            }
            else if(it==s.end()||it!=s.end()&&i.first!=A+1){
                s.insert({A+1,B});
            }
            k-=B;
        }
        else{
            s.erase({A,B});
            auto it=s.lower_bound({A+1,0});
            pair<int,int> i=*it;
            if(it!=s.end()&&i.first==A+1){
                s.erase({i});
                s.insert({A+1,k+i.second});
                s.insert({A,B-k});
            }
            else if(it==s.end()||it!=s.end()&&i.first!=A+1){
                s.insert({A+1,k});
                s.insert({A,B-k});  
            }
            break;
        }
    }
    //for(auto [a,b]:s)cout<<a<<' '<<b<<endl;
    for(auto i : s)ans=(ans*pow(i.first,i.second))%(int)(1e9+7);
    cout<<ans<<endl;
}