#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<vector<ll> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;

// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
//const int mod = 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;}

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}


// combination mod prime
// mintが必要
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
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];
  }
};

int main(){
    ll n,k;
    cin >> n >> k;
    vector<ll>a(n);
    rep(i,n)cin>>a[i];
    ll nm=0;//マイナス
    ll np=0;//プラス
    ll nz=0;//ゼロ
    rep(i,n){
        if(a[i]==0){
            nz++;
        }
        else if(a[i]>0){
            np++;
        }
        else{
            nm++;
        }
    }
    if(nm/2*2+np<k||(nm/2*2==k+1)){
        if(nz!=0){
            cout << 0 << endl;
            return 0;
        }
        rep(i,n){
            if(a[i]<0){
                a[i]=-a[i];
            }
        }
        sort(a.begin(),a.end());
        mint ans = 1;
        rep(i,k){
            ans *= a[i];
        }
        cout << -ans << endl;
        return 0;
    }
    priority_queue<ll>pq;
    vector<ll>m;
    rep(i,n){
        if(a[i]>0){
            pq.push(a[i]);
        }
        if(a[i]<0){
            m.push_back(-a[i]);
        }
    }
    m.push_back(0);
    m.push_back(0);
    sort(m.rbegin(),m.rend());
    mint ans = 1;
    if(k%2==1){
        ans *= pq.top();pq.pop();
        k--;
    }
    vector<ll>p;
    while(!pq.empty()){
        p.push_back(pq.top());
        pq.pop();
    }
    p.push_back(0);
    p.push_back(0);
    sort(p.rbegin(),p.rend());
    int i=0;
    int j=0;
    while(k>0){
        ll pnow = p[i]*p[i+1];
        ll mnow = m[j]*m[j+1];
        if(pnow>mnow){
            ans *= p[i];
            ans *= p[i+1];
            i+=2;
        }
        else{
            ans *= m[j];
            ans *= m[j+1];
            j += 2;
        }
        k-=2;
    }
    cout << ans << endl;
    return 0;
}


Measured memory_bytes: 9300