#pragma GCC optimize("O3")
#include<bits/stdc++.h> 
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>; 
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
struct mint{
    using ull=unsigned long long int;
    ull v;
    mint(ll vv=0){s(vv%mod+mod);}
    mint& s(ull vv){
        v=vv<mod?vv:vv-mod;
        return *this;
    }
    //オーバーロード
    mint operator-()const{return mint()-*this;}//mint型にキャスト
    mint&operator+=(const mint&val){return s(v+val.v);}
    mint&operator-=(const mint&val){return s(v+mod-val.v);}
    mint&operator*=(const mint&val){
        v=ull(v)*val.v%mod;
        return *this;
    }
    mint&operator/=(const mint&val){return *this*=val.inv();}
    mint operator+(const mint&val){return mint(*this)+=val;}
    mint operator-(const mint&val){return mint(*this)-=val;}
    mint operator*(const mint&val){return mint(*this)*=val;}
    mint operator/(const mint&val){return mint(*this)/=val;}
    mint pow(ll n)const{
        mint res(1),x(*this);
        while(n){
            if(n&1)res*=x;
            x*=x;
            n>>=1;
        }
        return res;
    }
    mint inv()const{return pow(mod-2);}
    //拡張ユークリッドの互除法
    /* mint inv()const{
        int x,y;
        int g=extgcd(v,mod,x,y);
        assert(g==1);
        if(x<0)x+=mod;
        return mint(x);
    }*/
    friend ostream& operator<<(ostream&os,const mint&val){
        return os<<val.v;
    }//出力
    bool operator<(const mint&val)const{return v<val.v;}
    bool operator==(const mint&val)const{return v==val.v;}
    bool operator>(const mint&val)const{return v>val.v;}
};
using ld=__float128;
int main(){
  mint ans=1;
  int n,k;
  cin>>n>>k;
  V<ll> a(n),m,p;
  ll cnt=0;
  for(int i=0;i<n;i++){
    cin>>a[i];
    if(a[i]>0)p.push_back(a[i]);
    else if(a[i]<0)m.push_back(-a[i]);
    else cnt++;
  }
  if(n-k<cnt){
    cout<<0<<"\n";
    return 0;
  }
  sort(all(p),greater<ll>());
  sort(all(m),greater<ll>());
  V<ld> t(p.size()+1,0.0),u(m.size()+1,0.0);
  for(int i=0;i<p.size();i++)t[i+1]+=log2l(ld(p[i]))+t[i];
  for(int i=0;i<m.size();i++)u[i+1]+=log2l(ld(m[i]))+u[i];
  ld res=-ld(1e9);
  int l=0,r=0;
  for(int i=0;i<=k;i+=2){
    if(m.size()<i||p.size()<k-i)continue;
    if(chmax(res,u[i]+t[k-i])){
         l=i,r=k-i;
    }
  }
  if(l||r){
    for(int i=0;i<l;i++)ans*=mint(m[i]);
    for(int i=0;i<r;i++)ans*=mint(p[i]);
    cout<<ans<<"\n";
    return 0;
  }
  else{
    if(cnt){
      cout<<0<<"\n";
      return 0;
    }
    sort(all(m));
    sort(all(p));
    l=0;r=0;
    for(int i=0;i<k;i++){
        if(l<p.size()&&r<m.size()){
          if(p[l]<m[r]){
              ans*=mint(p[l++]);
          }else{
             ans*=mint(m[r++]);
          }
        }
        else if(l<p.size())ans*=mint(p[l++]);
        else if(r<m.size())ans*=mint(m[r++]);
    }
    ans=mint(0)-ans;
    cout<<ans<<"\n";
  }
}


Measured memory_bytes: 9568