#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph= vector<vector<int>>; 
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define fi first 
#define se second
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b){a=min(a,b);}
// ミント
const int mod = 1e9+7 ;
// 998244353;

struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
//昆布
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
  mint p(int n,int k){
    return fact[n]*ifact[n-k] ;
  }
}   c(100005);
 
mint modpow(ll a,ll b){
 if(b==0) return 1 ;
 mint c= modpow(a,b/2) ;
 if(b%2==1) return c*c*a ;
 else return c*c ;
}

mint komb(ll n,ll m){
  mint x=1 ;mint y=1 ;
  rep(i,m){
    x*= n-i ;
    y*= i+1 ;
  }
  return x/y ;
}

 
 map<ll,ll> factor(ll n){  //素因数とオーダーをマップで管理
  map <ll,ll> ord ;  
  for(ll i=2;i*i<=n;i++){
        if(n%i==0){
            int res=0;
            while(n%i==0){
                n/=i;
                res++;
            }
            ord[i]=res;
        }
    }
   if(n!=1) ord[n]++;
   return ord ;
 }

int main(){
  ll n,k ; cin>>n>>k ;
  vector<P> A(n) ;
  rep(i,n){
    ll a ;cin>> a ;
    if(a==0){
      A[i].fi = abs(a) ;
      A[i].se =0 ;
    }
    if(a>0){
      A[i].fi= abs(a) ;
      A[i].se = 1 ;
    }
    if(a<0){
      A[i].fi = abs(a) ;
      A[i].se= -1 ;
    }
  }

  sort(A.rbegin(),A.rend()) ;
  if(n==1)  cout<< (A[0].fi*A[0].se) <<endl;
  else if(n==k){
    mint cns=1 ;
    rep(i,k){
      cns= cns*A[i].fi*A[i].se ;
    }
    cout<<cns<<endl ;
  }
  else{
    mint  ans= 1 ;
    ll hugo = 0 ; bool ok= 0 ;
    rep(i,k){
     ans = ans* A[i].fi;
     if(A[i].se==-1) hugo++ ;
     if(A[i].se==0) ok=1  ;
    }
    if(ok) cout<<0<<endl ;
    else if(hugo%2==0) cout<<ans<<endl ;
    else{
      ll ap=INF ;
      ll am= INF ;
      ll bp= INF ;
      ll bm= INF ;
     rep3(i,k-1,0){
     if(A[i].se==1){
       ap= A[i].fi ;
       break ;
     }
     }
     rep3(i,k-1,0){
       if(A[i].se ==-1){
         am= A[i].fi ;
         break ;
       }
     }
     rep2(i,k,n-1){
       if(A[i].se ==1){
         bp = A[i].fi ;
         break ;
       }
     }
     
     rep2(i,k,n-1){
       if(A[i].se == -1){
         bm = A[i].fi ;
         break ;
       }
     }
     
     
     if((ap==INF||bm==INF)&&(am==INF || bp==INF)){
       mint bns= 1 ;
       rep(i,k){
         bns *=A[n-1-i].fi* A[n-1-i].se;
       }
    
        cout<<bns<<endl ;
     }
     else if(ap==INF || bm ==INF) {
       ans= ans*bp/am ;
       cout<<ans<<endl ;
       }
     else if(am== INF || bp== INF) {
       ans= ans*bm/ap ;
       cout<<ans<<endl ;
     }
     
     else{
        if(ap*bp>am*bm) ans = ans* bp/am ;
         else ans = ans* bm/ap ;
     cout<<ans<<endl ;
     }

    
    }
  }
    return 0;
  }
   

   // 7 3 -1 -2 -3 -4 -5 6 7 

Measured memory_bytes: 6440