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

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
//typedef vector<vector<ll>> Graph;

const ll mod = 1e9 + 7;
//const ll mod = 998244353;

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define spa << " " <<
#define fi first
#define se second

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){
os << "(" << v.first << ", " << v.second << ")"; return os;
}
template<class T> ostream& operator << (ostream& os, const vector<T> v){
for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << " ";} os << v[i];} return os;
}
template<class T> ostream& operator << (ostream& os, const vector<vector<T>> v){
for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os;
}

template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<endl;}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<endl;};

string num2bit(ll num, ll len){
    string bit = "";
    REP(i, len){
    bit += char('0'+(num>>i & 1));
    }
    reverse(bit.begin(), bit.end());
    return bit;
}

template <std::uint_fast64_t Modulus> class modint {
  // long long から modint を作るときは必ず正の数にしてからコンストラクタに入れること！ 
  // そうしないとバグります
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};
using mint = modint<mod>;

template <class T, class U> constexpr T power(T x, U exp) {
  T ret = static_cast<T>(1);
  while (exp) {
    if (exp % static_cast<U>(2) == static_cast<U>(1))
      ret *= x;
    exp /= static_cast<U>(2);
    x *= x;
  }
  return ::std::move(ret);
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll N, K;
    cin >> N >> K;
    vector<ll> A(N);
    REP(i, N) cin >> A[i];

    mint res = 1;
    if(N==K){
        REP(i, N) res *= (A[i]+mod);
        cout << res.value() << endl;
    }else{
        bool allneg = true;
        REP(i, N) if(A[i]>=0) allneg = false;
        if(allneg){
            if(K&1){
                sort(A.rbegin(), A.rend());
                REP(i, K) res *= (A[i]+mod);
            }else{
                sort(A.begin(), A.end());
                REP(i, K) res *= (A[i]+mod);
            }
            cout << res.value() << endl;
        }else{
            vector<ll> neg, pos;
            REP(i, N){
                if(A[i]<0) neg.push_back(A[i]);
                else pos.push_back(A[i]);
            }
            sort(neg.begin(), neg.end());
            sort(pos.rbegin(), pos.rend());
            ll X = neg.size();
            ll Y = pos.size();

            // cout << neg << endl;
            // cout << pos << endl;

            vector<mint> S_neg(X+1, 1);
            vector<mint> S_pos(Y+1, 1);
            REP(i, X) S_neg[i+1] = S_neg[i] * mint(neg[i]+mod);
            REP(i, Y) S_pos[i+1] = S_pos[i] * mint(pos[i]+mod);

            ll k = max(K-Y, 0ll);
            if(k%2==1) k++;

            mint x = 1;
            mint y = 1;

            x = S_neg[k];
            y = S_pos[K-k];

            // REP(i, k) x *= (neg[i]+mod);
            // REP(i, K-k) y *= (pos[i]+mod);

            ll idx = k;
            // dump(idx)
            // dump(x.value())
            // dump(y.value())

            while(1){
                if(idx+1>=X or K-idx-2<0) break;
                // dump(neg[idx])
                // dump(neg[idx]+1)
                // dump(pos[K-idx-1])
                // dump(pos[K-idx-2])
                if(neg[idx]*neg[idx+1]>=pos[K-idx-1]*pos[K-idx-2]){
                    x = S_neg[idx+2];
                    y = S_pos[K-idx-2];
                    //dump((x*y).value())
                    // x *= (neg[idx]+mod);
                    // x *= (neg[idx+1]+mod);
                    // y /= pos[K-idx-1];
                    // y /= pos[K-idx-2];
                }else{
                    break;
                }
                idx += 2;
            }

            res *= x;
            res *= y;
            cout << res.value() << endl;
        }
    }

    return 0;
}


Measured memory_bytes: 7968