#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using u64 = uint_fast64_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr char ln =  '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true;} return false; }
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return true;} return false; }
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
void print() { cout << "\n"; }
template<class T, class... Args>
void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
///////////////////////////////////////////////////////////////////////////////////////////////////////////////

template <uint_fast64_t Modulus> 
struct ModInt {
    using u64 = uint_fast64_t;

    u64 a;

    constexpr ModInt(const long long x = 0) noexcept : a(x >= 0 ? x % Modulus : (Modulus - (-x) % Modulus) % 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 long long rhs) const noexcept {return ModInt(*this) ^= rhs;}
    constexpr bool operator==(const ModInt &rhs) const noexcept {return a == rhs.a;}
    constexpr bool operator!=(const ModInt &rhs) const noexcept {return a != rhs.a;}
    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&1) *this *= rhs;
            exp >>= 1;
            rhs *= rhs;
        }
        return *this;
    }
    constexpr ModInt &operator^=(long long exp) noexcept {
        ModInt rhs = a;
        a = 1;
        while (exp) {
            if (exp&1) *this *= rhs;
            exp >>= 1;
            rhs *= rhs;
        }
        return *this;
    }

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

using mint = ModInt<MOD>;

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int N,K; cin >> N >> K;
    vector<pll> A(N);
    rep(i,N) {
        int a; cin >> a;
        if (a < 0) A[i] = pll(-a,1);
        else A[i] = pll(a,0);
    }

    sort(all(A)); reverse(all(A));
    int cnt = 0;
    rep(i,K) {
        cnt += A[i].second;
    }
    if (cnt%2==0) {
        mint ans = 1;
        rep(i,K) ans *= A[i].first;
        cout << ans << ln;
        return 0;
    }
    ll a = -1, b = -1, c = 1, d = 1, anum = -1 , bnum = -1;
    for (int p = K; p < N; p++) {
        if (a==-1 and cnt < K and A[p].second) {
            rep(i,K) {
                if (!A[i].second) {
                    a = A[i].first;
                    anum = i;
                }
            }
            c = A[p].first;
        }
        if (b==-1 and !A[p].second) {
            rep(i,K) {
                if (A[i].second) {
                    b = A[i].first;
                    bnum = i;
                }
            }
            d = A[p].first;
        }
    }
    if (a==-1 and b==-1) {
        reverse(all(A));
        mint ans = -1;
        rep(i,K) {
            ans *= A[i].first;
        }
        cout << ans << ln;
        return 0;
    }
    if (a==-1) {
        mint ans = 1;
        rep(i,K) {
            if (i != bnum) ans *= A[i].first;
        }
        ans *= d;
        cout << ans << ln;
    } else if (b==-1) {
        mint ans = 1;
        rep(i,K) {
            if (i != anum) ans *= A[i].first;
        }
        ans *= c;
        cout << ans << ln;
    } else if (a*d >= b*c) {
        mint ans = 1;
        rep(i,K) {
            if (i != bnum) ans *= A[i].first;
        }
        ans *= d;
        cout << ans << ln;
    } else {
        mint ans = 1;
        rep(i,K) {
            if (i != anum) ans *= A[i].first;
        }
        ans *= c;
        cout << ans << ln;
    }
}


Measured memory_bytes: 6368