#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int n, k, m;
vector<long long> v;
long long modder = 1000000000 + 7;

struct int2
{
    int x;
    int y;
};

static void Increase(int index)
{
    v[index]++;
    k--;
    if(index < n && k > 0)
    {
        if(v[index + 1] < v[index])
        {
            Increase(index + 1);
        }
    }
}

static bool Compare(int2 a, int2 b)
{
    return a.x > b.x;
}

int main()
{
    cin >> n >> k >> m;
    v.resize(n);
    vector<int2> neg;

    int nCount = 0;

    for(int i = 0; i < n; i++)
    {
        cin >> v[i];

        if(v[i] < 0)
        {
            nCount++;
            int2 negative;
            negative.x = v[i];
            negative.y = i;
            neg.push_back(negative);
        }
    }
    if(nCount < m)
    {
        cout << -1;
        return 0;
    }

    sort(neg.begin(), neg.end(), Compare);

    int sz = neg.size();
    for(int i = 0; i < sz; i++)
    {
        if(nCount == m) break;
        int index = neg[i].y;
        v[index] = 0;
        k += neg[i].x;
        nCount--;
    }

    if(k < 0)
    {
        cout << -1;
        return 0;
    }

    sort(v.begin(), v.end());

    int fnn = 0;
    for(int i = 0; i < n; i++)
    {
        if(v[i] < 0) continue;
        fnn = i; break;
    }

    while(k > 0)
    {
        Increase(fnn);
    }

    nCount = 0;

    for(int i = 0; i < n; i++)
    {
        if(v[i] < 0)
        {
            nCount++;
        }
    }

    if(nCount != m)
    {
        cout << -1;
        return 0;
    }
    long long ans = 1;
    for(int i = 0; i < n; i++)
    {
        ans = (ans * abs(v[i])) % modder;
    }
    cout << ans;
}