#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
#define SZ(x) ((int)(x).size())
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 28;
const ll INF64 = 1ll << 60;
const int mod = 1000000007;
//const int mod = 998244353;

template <class T>inline bool chmin(T &a, const T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <class T>inline bool chmax(T &a, const T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
template <class T>inline void line_out(const vector<T> vec) {
  int n = SZ(vec);
  rep(i, n) {
    cout << vec[i];
    if(i < n-1) cout << " ";
  }
  cout << endl;
  return;
}

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
  {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const
  {
    mint res(*this);
    return res -= a;
  }
  mint &operator++()
  {
    if ((x += 1) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator--()
  {
    if ((x += mod - 1) >= mod)
      x -= mod;
    return *this;
  }
  mint operator*(const mint a) const
  {
    mint res(*this);
    return res *= 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
  {
    mint res(*this);
    return res /= a;
  }
};
  

int main()
{
  int n, k;
  cin >> n >> k;
  vector<ll> a(n);
  rep(i, n) cin >> a[i];
  auto comp = [&](ll x, ll y) {
    return abs(x) > abs(y);
  };

  sort(ALL(a), comp);
  int f = 0;
  ll p_del = INF64, n_del = -INF64;
  ll p_ch = -INF64, n_ch = INF64;
  rep(i, k) {
    if(a[i] < 0) ++f;
    if(a[i] >= 0) chmin(p_del, a[i]);
    else chmax(n_del, a[i]);
  }
  rep(i, n-k) {
    if(a[k+i] >= 0) chmax(p_ch, a[k+i]);
    else chmin(n_ch, a[k+i]);
  }

  mint ans = 1;
  rep(i, k) ans *= abs(a[i]);

  if(f%2==0) {
    cout << ans.x << endl;
    return 0;
  }



  if(p_del != INF64 && n_ch != INF64 && n_del != -INF64 && p_ch != -INF64) {
    if(abs(n_ch)*abs(n_del) >= p_ch * p_del) {
      ans /= p_del;
      ans *= abs(n_ch);
    }
    else {
      ans /= abs(n_del);
      ans *= p_ch;
    }
  }
  else if(p_del != INF64 && n_ch != INF64) {
    ans /= p_del;
    ans *= abs(n_ch);
  }
  else if(n_del != -INF64 && p_ch != -INF64) {
    ans /= abs(n_del);
    ans *= p_ch;
  }
  else {
    ans = 1;
    sort(rALL(a), comp);
    rep(i, k) ans *= a[i];
  }
  cout << ans.x << endl;
}


Measured memory_bytes: 4844