#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n, k, b;
    cin >> n >> k >> b;
    vector<int> poz;
    vector<int> neg;
    int temp;
    for(int i = 0; i < n; i++){
        cin >> temp;
        if(temp >= 0){
            poz.push_back(temp);
        }
        else if(temp < 0){
            neg.push_back(temp);
        }
    }
    sort(neg.begin(), neg.end(), greater<int>());


    if(neg.size() < b){
        cout << "-1\n";
        return 0;
    }

    int kell = neg.size()-b;
    int elhasznal = 0;
    for(int i = 0; i < kell; i++){
        elhasznal += -neg[i];
        poz.push_back(0);
    }

    if(elhasznal > k){
        cout << "-1\n";
        return 0;
    }
    k -= elhasznal;

    long long ret = 1;
    long long mod = 1e9 + 7;
    if(poz.size() > 0){
        sort(poz.begin(), poz.end());
        int elozo = 0;
        int meddig = 0;
        int feltolt = 0;
        for(int i = 1; i < poz.size(); i++){
            elozo = elozo + (poz[i]-poz[i-1])*i;
            if(elozo <= k){
                meddig = i;
                feltolt = elozo;
            }
            else{
                break;
            }
        }

        k -= feltolt;
        int also_db = meddig+1;
        int also = poz[meddig];

        //cout << "also: " << also << " also_db: " <<also_db << " " << k << "\n";

        //cout << "also_db " << also_db << " k " << k << "\n";
        int osszes_novel = k / also_db;
        also += osszes_novel;
        k -= osszes_novel*also_db;
        //cout << "osszes_novel " << osszes_novel << "\n";

        also_db -= k;
        //cout << "vegso alsodb " << also_db << " " << also << "\n";
        for(int i = 0; i < also_db; i++){
            ret *= also;
            ret %= mod;
        }
        for(int i = 0; i < k; i++){
            ret *= (also + 1);
            ret %= mod;
        }

        for(int i = also_db+k; i < poz.size(); i++){
            ret *= poz[i];
            ret %= mod;
        }

        for(int i = neg.size()-b; i < neg.size(); i++){
            ret *= abs(neg[i]);
            ret %= mod;
            //cout << "raszoroz " << neg[i] << "\n";
        }
    }
    else{
        long long sum = 0;
        for(int i = 0; i < neg.size(); i++){
            sum -= (neg[i]+1);
        }

        if(sum < k){
            cout << "-1\n";
            return 0;
        }

        int elozo = 0;
        int meddig = neg.size()-1;
        int feltolt = 0;
        for(int i = neg.size()-2; i >= 0; i--){
            elozo = elozo + (-neg[i+1]+neg[i])*(neg.size()-i-1);
            //cout << i << " " << neg[i] << " " << elozo <<"\n";
            if(elozo <= k){
                meddig = i;
                feltolt = elozo;
            }
            else{
                break;
            }
        }
        //cout << meddig << " " << feltolt << "\n";

        k -= feltolt;
        int also_db = neg.size()-meddig;
        int also = -neg[meddig];

        //cout << "also: " << also << " also_db: " <<also_db << " " << k << "\n";

        //cout << "also_db " << also_db << " k " << k << "\n";
        int osszes_novel = k / also_db;
        also -= osszes_novel;
        k -= osszes_novel*also_db;
        //cout << "osszes_novel " << osszes_novel << "\n";

        also_db -= k;
        //cout << "vegso alsodb " << also_db << " " << also << "\n";
        for(int i = 0; i < also_db; i++){
            ret *= also;
            ret %= mod;
        }
        for(int i = 0; i < k; i++){
            ret *= (also - 1);
            ret %= mod;
        }

        for(int i = 0; i < neg.size()-(also_db+k); i++){
            //cout << "szoroz " << neg[i] << "\n";
            ret *= -neg[i];
            ret %= mod;
        }

    }


    cout << ret << "\n";
}