#include <bits/stdc++.h>

using namespace std;

using ll = long long;

constexpr char newl = '\n';
constexpr ll INF = 1e15;

// https://noshi91.hatenablog.com/entry/2019/03/31/174006
template <std::uint_fast64_t Modulus>
struct ModInt {
    using u64 = std::uint_fast64_t;

    static constexpr u64 MOD = Modulus;

    u64 val;

    constexpr ModInt(const u64 x = 0) noexcept : val(x % MOD) {}

    constexpr ModInt operator+() const noexcept { return ModInt(*this); }
    constexpr ModInt operator-() const noexcept {
        ModInt res(*this);
        if (res.val != 0) res.val = MOD - res.val;
        return res;
    }

    constexpr bool operator==(const ModInt& rhs) const noexcept { return val == rhs.val; }
    constexpr bool operator!=(const ModInt& rhs) const noexcept { return val != rhs.val; }

    // prefix increment/decrement
    constexpr ModInt& operator++() noexcept { return *this += ModInt(1); }
    constexpr ModInt& operator--() noexcept { return *this -= ModInt(1); }

    // postfix increment/decrement
    constexpr ModInt operator++(int) noexcept {
        ModInt tmp(*this);
        ++*this;
        return tmp;
    }
    constexpr ModInt operator--(int) noexcept {
        ModInt tmp(*this);
        --*this;
        return tmp;
    }

    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 {
        val += rhs.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr ModInt& operator-=(const ModInt& rhs) noexcept {
        if (val < rhs.val) val += MOD;
        val -= rhs.val;
        return *this;
    }
    constexpr ModInt& operator*=(const ModInt& rhs) noexcept {
        val = val * rhs.val % MOD;
        return *this;
    }

    // prime Modulus only
    constexpr ModInt& operator/=(const ModInt& rhs) noexcept {
        return *this *= rhs.inv();
    }

    // prime Modulus only
    constexpr ModInt inv() const noexcept {
        return pow(*this, MOD - 2);
    }
};

template<std::uint_fast64_t Modulus>
constexpr ModInt<Modulus> pow(ModInt<Modulus> x, std::uint_fast64_t n) {
    ModInt<Modulus> res(1);
    while (n) {
        if (n & 1) res *= x;
        x *= x;
        n >>= 1;
    }
    return res;
}

template<std::uint_fast64_t Modulus>
istream& operator>>(istream& is, ModInt<Modulus>& x) {
    std::uint_fast64_t val;
    is >> val;
    x = ModInt<Modulus>(val);
    return is;
}

template<std::uint_fast64_t Modulus>
ostream& operator<<(ostream& os, const ModInt<Modulus>& x) {
    return os << x.val;
}

using mint = ModInt<1000000007>;

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

    int n, K;
    cin >> n >> K;

    vector<ll> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end(), [&](ll x, ll y){ return abs(x) > abs(y);});

    bool minus = false;
    mint ans = 1;
    ll minus_val = INF, plus_val = -INF;
    for (int i = 0; i < K; i++) {
        if (a[i] < 0) {
            minus = !minus;
            minus_val = a[i];
        } else {
            plus_val = a[i];
        }
        ans *= mint::MOD + a[i];
    }

    if (!minus) {
        cout << ans << newl;
        return 0;
    }

    if (!(plus_val > -INF && minus_val < INF)) {
        
    }

    ll mv2 = INF, pv2 = -INF;
    for (int i = K; i < n; i++) {
        if (a[i] < 0 && mv2 == INF) {
            mv2 = a[i];
        }

        if (a[i] > 0 && pv2 == -INF) {
            pv2 = a[i];
        }             
    }

    ll val1 = -INF;
    if (mv2 < INF && plus_val > -INF) {
        val1 = (minus_val < INF ? minus_val : 1) * mv2;
    }

    ll val2 = -INF;
    if (pv2 > -INF && minus_val < INF) {
        val2 = (plus_val > -INF ? plus_val : 1) * pv2;
    }

    if (val1 > -INF && val2 > -INF) {
        if (val1 > val2) {
            ans /= mint::MOD + plus_val;
            ans *= mint::MOD + mv2;            
        } else {
            ans /= mint::MOD + minus_val;
            ans *= mint::MOD + pv2;            
        }
    } else if (val1 > -INF) {
        ans /= mint::MOD + plus_val;
        ans *= mint::MOD + mv2;
    } else if (val2 > -INF) {
        ans /= mint::MOD + minus_val;
        ans *= mint::MOD + pv2;
    } else {
        ans = 1;
        reverse(a.begin(), a.end());
        for (int i = 0; i < K; i++) {
            //cerr << a[i] << ",";
            ans *= mint::MOD + a[i];
        }
        //cerr << newl;
    }
    cout << ans << newl;

    return 0;
}

Measured memory_bytes: 4760