#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>

using namespace std;

#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()

#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

using ll = long long;

constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3までは右下左上 4~7までは斜め
constexpr int dx[] = { 1, 0, -1, 0, 1, -1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1 };

namespace {
    template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
    template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

    // 標準出力
    void Write(long long x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Write(const T& x, const char* end = "\n") { std::cout << x << end; }
    template <typename T, typename U> void Write(const T& x, const U& y, const char* end = "\n") { std::cout << x << " " << y << end; }
    template <typename T, typename U, typename V> void Write(const T& x, const U& y, const V& z, const char* end = "\n") { std::cout << x << " " << y << " " << z << end; }
    //template <typename... Args> void Write(Args const&... args) { bool a = true; for (auto const& x : { args... }) { if (a) a = false; else std::cout << " "; std::cout << x; } std::cout << "\n"; }
    template <typename T> void Write(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }
    template <typename T> void Write(const std::vector<std::vector<T>>& x, const char* sep = " ", const char* end = "\n") { for (auto v : x) Write(v, sep, end); }

    // 標準入力
    struct Read {
        std::size_t szi, szj;
        Read(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
        template <typename T> operator T () const { T a; std::cin >> a; return a; }
        template <typename T> operator std::vector<T>() const { std::vector<T> a(szi); for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i]; return a; }
        template <typename T> operator std::vector<std::vector<T>>() const {
            std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
            for (std::size_t i = 0; i < szi; ++i) for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j]; return a;
        }
        template <typename T, typename U> operator std::vector<std::pair<T, U>>() const {
            std::vector<std::pair<T, U>> a(szi);
            for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i].first >> a[i].second; return a;
        }
    };
    struct Reads {
        template <typename T> Reads(T& a) { std::cin >> a;}
        template <typename T, typename U> Reads(T& a, U& b) { std::cin >> a >> b; }
        template <typename T, typename U, typename V> Reads(T& a, U& b, V& c) { std::cin >> a >> b >> c; }
        template <typename T, typename U, typename V, typename W> Reads(T& a, U& b, V& c, W& d) { std::cin >> a >> b >> c >> d; }
    };

    Read read;

    template<int MOD> struct Fp {
        long long val;
        constexpr Fp(long long v = 0) noexcept : val(v% MOD) {
            if (val < 0) val += MOD;
        }
        constexpr int getmod() { return MOD; }
        constexpr Fp operator - () const noexcept {
            return val ? MOD - val : 0;
        }
        constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
        constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
        constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
        constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
        constexpr Fp& operator += (const Fp& r) noexcept {
            val += r.val;
            if (val >= MOD) val -= MOD;
            return *this;
        }
        constexpr Fp& operator -= (const Fp& r) noexcept {
            val -= r.val;
            if (val < 0) val += MOD;
            return *this;
        }
        constexpr Fp& operator *= (const Fp& r) noexcept {
            val = val * r.val % MOD;
            return *this;
        }
        constexpr Fp& operator /= (const Fp& r) noexcept {
            long long a = r.val, b = MOD, u = 1, v = 0;
            while (b) {
                long long t = a / b;
                a -= t * b; std::swap(a, b);
                u -= t * v; std::swap(u, v);
            }
            val = val * u % MOD;
            if (val < 0) val += MOD;
            return *this;
        }
        constexpr bool operator == (const Fp& r) const noexcept {
            return this->val == r.val;
        }
        constexpr bool operator != (const Fp& r) const noexcept {
            return this->val != r.val;
        }
        friend constexpr std::ostream& operator << (std::ostream& os, const Fp<MOD>& x) noexcept {
            return os << x.val;
        }
        constexpr Fp pow(long long n) noexcept {
            if (n == 0) return 1;
            auto t = pow(val, n / 2);
            t = t * t;
            if (n & 1) t = t * val;
            return t;
        }
    };
    using mint = Fp<mod>;
}

int main() {

    int n, k; Reads(n, k);
    vector<ll> b = Read(n);
    vector<ll> a;
    rep(i, n) {
        if (b[i] == 0) continue;
        a.emplace_back(b[i]);
    }
    bool has_zero = (n != a.size());
    n = a.size();

    if (n < k) {
        Write(0);
        return 0;
    }

    sort(allof(a), [](ll lhs, ll rhs) {
        return abs(lhs) > abs(rhs);
        });

    mint ans = 1LL;

    int sign = 1;
    ll last_p = -1, last_n = -1;
    rep(i, k) {
        ans *= abs(a[i]);
        if (a[i] < 0) {
            sign = 1 - sign;
            last_n = abs(a[i]);
        }
        else last_p = abs(a[i]);
    }

    if (sign == 0) {
        // 最後のマイナスを捨てて次のプラスを取る
        // 最後のプラスを捨てて次のマイナスを取る
        // 次のを探す
        ll top_p = -1;
        ll top_n = -1;
        Rep(i, k, n) {
            if (top_n != -1 && top_p != -1) break;

            if (top_p == -1 && a[i] > 0 && last_n != -1) {
                top_p = abs(a[i]);
            }
            else if(top_n == -1 && a[i] < 0 && last_p != -1) {
                top_n = abs(a[i]);
            }
        }

        if (top_n == -1 && top_p == -1) {
            // 一番小さいの目指す
            ans = 1;
            Rep(i, n - k, n) ans *= abs(a[i]);
            ans *= -1;
            if (has_zero) ans = 0;
        }
        else if(top_n == -1) {
            ans /= last_n;
            ans *= top_p;
        }
        else if (top_p == -1) {
            ans /= last_p;
            ans *= top_n;
        }
        else {
            __int128 first = top_p * last_p;
            __int128 second = top_n * last_n;
            if (first > second) {
                ans /= last_n;
                ans *= top_p;
            }
            else {
                ans /= last_p;
                ans *= top_n;
            }
        }
    }

    cout << ans << endl;


    return 0;
}


Measured memory_bytes: 6912