#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};

template<int mod>
struct ModInt {
    long long x;
 
    ModInt() : x(0) {}
    ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    explicit operator int() const {return x;}
 
    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }
 
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
 
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
 
    ModInt inverse() const{
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }

    ModInt power(long long p) const{
        int a = x;
        if (p==0) return 1;
        if (p==1) return ModInt(a);
        if (p%2==1) return (ModInt(a)*ModInt(a)).power(p/2)*ModInt(a);
        else return (ModInt(a)*ModInt(a)).power(p/2);
    }

    ModInt power(const ModInt p) const{
        return ((ModInt)x).power(p.x);
    }

    friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
        return os << p.x;
    }
    friend istream &operator>>(istream &is, ModInt<mod> &a) {
        long long x;
        is >> x;
        a = ModInt<mod>(x);
        return (is);
    }
};

using modint = ModInt<mod>;



int n,k;
ll a[200010];

void solve(){
  cin >> n >> k;
  int neg_cnt=0,zero_cnt=0;
  rep(i,n){
    cin >> a[i];
    if(a[i]<0) neg_cnt+=1;
    if(a[i]==0) zero_cnt+=1;
  }
  if(n==k){
    modint ans=1;
    rep(i,n){
      ans*=(modint)a[i];
    }
    cout << ans << endl;
    return;
  }
  if(zero_cnt>n-k){
    cout << 0 << endl;
    return;
  }
  if(neg_cnt==n && k%2==1){
    sort(a,a+n);
    modint ans=1;
    rep(i,k) ans*=(modint)a[n-1-i];
    cout << ans << endl;
    return;
  }
  sort(a,a+n,[](ll a,ll b){return abs(a)>abs(b);});
  ll min_pos=mod,min_neg=mod;
  neg_cnt=0;
  rep(i,k){
    if(a[i]>0) min_pos=abs(a[i]);
    if(a[i]<0) {
      min_neg=abs(a[i]);
      neg_cnt+=1;
    }
  }
  if(neg_cnt%2==0){
    modint ans=1;
    rep(i,k){
      ans*=(modint)a[i];
      //cout << a[i] << endl;
    }
    cout << ans << endl;
    return;
  }
  ll max_pos=0,max_neg=0;
  per(i,n-k){
    if(a[i+k]>0) max_pos=abs(a[i+k]);
    if(a[i+k]<0) max_neg=abs(a[i+k]);
  }
  
  modint ans=1;
  rep(i,k){
    ans*=(modint)a[i];
  }
  //cout << min_pos << " " << max_pos << " " << min_neg << " " << max_neg << endl;
  if(min_pos*max_pos>=min_neg*max_neg || min_pos==mod || max_neg==0){
    cout << -ans*(modint)max_pos/(modint)min_neg << endl;
  }
  else{
    cout << -ans*(modint)max_neg/(modint)min_pos << endl;
  }
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(50);
  solve();
}

Measured memory_bytes: 5212