#include <iostream>
#include <algorithm>
#include <vector>

template <int MOD>
struct ModInt {
    using lint = long long;
    int val;

    // constructor
    ModInt(lint v = 0) : val(v % MOD) {
        if (val < 0) val += MOD;
    };

    // unary operator
    ModInt operator+() const { return ModInt(val); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt inv() const { return this->pow(MOD - 2); }

    // arithmetic
    ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
    ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
    ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
    ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
    ModInt pow(lint n) const {
        auto x = ModInt(1);
        auto b = *this;
        while (n > 0) {
            if (n & 1) x *= b;
            n >>= 1;
            b *= b;
        }
        return x;
    }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        if ((val += x.val) >= MOD) val -= MOD;
        return *this;
    }
    ModInt& operator-=(const ModInt& x) {
        if ((val -= x.val) < 0) val += MOD;
        return *this;
    }
    ModInt& operator*=(const ModInt& x) {
        val = lint(val) * x.val % MOD;
        return *this;
    }
    ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }

    // compare
    bool operator==(const ModInt& b) const { return val == b.val; }
    bool operator!=(const ModInt& b) const { return val != b.val; }
    bool operator<(const ModInt& b) const { return val < b.val; }
    bool operator<=(const ModInt& b) const { return val <= b.val; }
    bool operator>(const ModInt& b) const { return val > b.val; }
    bool operator>=(const ModInt& b) const { return val >= b.val; }

    // I/O
    friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept {
        lint v;
        is >> v;
        x = v;
        return is;
    }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
};

constexpr int MOD = 1000000007;
using mint = ModInt<MOD>;
using lint = long long;

void solve() {
    int n, k;
    std::cin >> n >> k;

    std::vector<int> xs(n);
    for (auto& x : xs) std::cin >> x;
    std::sort(xs.begin(), xs.end(),
              [](auto x, auto y) { return std::abs(x) > std::abs(y); });

    mint ans = 1;
    int sign = 1;
    for (int i = 0; i < k; ++i) {
        ans *= xs[i];
        if (xs[i] == 0) sign = 0;
        if (xs[i] < 0) sign = -sign;
    }

    if (sign != -1) {
        std::cout << ans << "\n";
        return;
    }

    lint minpos = -1, minneg = 1;
    for (int i = 0; i < k; ++i) {
        if (xs[i] >= 0) minpos = xs[i];
        if (xs[i] <= 0) minneg = xs[i];
    }

    lint maxpos = -1, maxneg = 1;
    for (int i = n - 1; i >= k; --i) {
        if (xs[i] >= 0) maxpos = xs[i];
        if (xs[i] <= 0) maxneg = xs[i];
    }

    lint p = -1, q = 1;
    // prod * (p / q)

    if (minpos >= 0 && maxneg <= 0) {
        if (p * minpos < q * (-maxneg)) {
            p = -maxneg;
            q = minpos;
        }
    }

    if (minneg <= 0 && maxpos >= 0) {
        if (p * (-minneg) < q * maxpos) {
            p = maxpos;
            q = -minneg;
        }
    }

    if (p >= 0) {
        std::cout << -ans * p / q << "\n";
        return;
    }

    // all negative
    ans = 1;
    for (int i = 0; i < k; ++i) ans *= xs[n - i - 1];
    std::cout << ans << "\n";
}

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

    solve();

    return 0;
}


Measured memory_bytes: 3988