#include <bits/stdc++.h>

using namespace std;

int main()
{
    const int MOD = 1000000007;
    long long N, K, b;
    cin >> N >> K >> b;
    vector<long long> szamok(N);

    for (int i = 0; i < N; i++)
    {
        cin >> szamok[i];
    }

    vector<pair<long long, int>> negs;

    for (int i = 0; i < N; i++)
    {
        if (szamok[i] < 0)
        {

            negs.push_back({szamok[i], i});
        }
    }

    long long eltavolitas = negs.size() - b;
    if (eltavolitas < 0)
    {
        cout << -1 << "\n";
        return 0;
    }
    sort(negs.begin(), negs.end());

    for (int j = 0; j < eltavolitas; j++)
    {
        int idx = negs[j].second;
        K += szamok[idx];
        szamok[idx] = 0;
    }
    if (K < 0)
    {
        cout << -1 << "\n";
        return 0;
    }
    vector<long long> pos;
    for (int i = 0; i < N; i++)
    {
        if (szamok[i] > 0)
            pos.push_back(szamok[i]);
        else if (szamok[i] == 0 && K > 0)
        {
            szamok[i] = 1;
            pos.push_back(1);
            K--;
        }
        else
        {
            pos.push_back(szamok[i]);
        }
    }
    sort(pos.begin(), pos.end());

    queue<long long> q;
    for (auto x : pos)
        q.push(x);

    while (K > 0 && !q.empty())
    {
        long long x = q.front();
        q.pop();
        x++;
        q.push(x);
        K--;
    }

    long long res = 1;
    while (!q.empty())
    {
        long long x = q.front();
        q.pop();
        res = (res * ((x + MOD) % MOD)) % MOD;
    }
    cout << res << "\n";

    return 0;
}