#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
} 


const int mod = 1000000007;
const int max_n = 200005;
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, 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(max_n);


int main(){
    ll n,k;cin >> n >> k;
    vpl v(n);
    mint ans=1;
    rep(i,n){
        ll t;cin >> t;
        if(k==n)ans*=t;
        v[i].fi=abs(t);
        v[i].se=(t<0? -1:1);
    }
    sort(all(v));
    if(k==n)cout << ans <<endl,exit(0);
    if(k%2){
        bool check=true;
        rep(i,n){
            if(v[i].se==1)check=false;
        }
        if(check){
            rep(i,k){
                ans*=v[i].fi;
            }
            cout << ans*-1 <<endl;
            return 0;
        }
    }
    rev(all(v));
    ll o=0;
    rep(i,k){
        ans*=v[i].fi;
        if(v[i].se==-1)o^=1;
    }
    if(o==0){
        cout << ans <<endl;
    }
    else{
        ll p=inf,m=inf;
        rep(i,k){
            if(v[i].se==-1)chmin(m,v[i].fi);
            else chmin(p,v[i].fi);
        }
        ll pp=-1,mm=-1;
        repl(i,k,n){
            if(v[i].se==-1&&mm==-1)mm=v[i].fi;
            if(v[i].se==1&&pp==-1)pp=v[i].fi;
        }
        if(p==inf||mm==-1){
            ans/=m;
            ans*=pp;
            cout << ans <<endl;return 0;
        }
        if(pp==-1){
            ans/=p;
            ans*=mm;
            cout << ans <<endl;return 0;
        }
        if(m*mm<p*pp){
             ans/=m;
            ans*=pp;
            cout << ans <<endl;return 0;
        }
        else{
            ans/=p;
            ans*=mm;
            cout << ans <<endl;return 0;
        }
    }
}

Measured memory_bytes: 9580