#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long n,k,b;
    cin>>n>>k>>b; vector<int>a(n);
    a.push_back(200001);
    for(int i=0; i<n; i++){cin>>a[i];}
    sort(a.begin(),a.end());
    long long p=b,s=0,mod=10e9+7;
    while(a[p]<0 && p<n){s+=a[p]; a[p]=0; p++;}
    k+=s;
    if(k>=0){
        while(k>0)
            {for(int i=b; i<n; i++)
                {if(a[i]!=a[i+1]){a[i]++; k--; break;}}}
        p=1;
        for(int i=0; i<n; i++){p=(p*a[i])%mod;}
        cout<<p<<endl;}
    else cout<<-1<<endl;
    return 0;
}