#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << endl; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

template<ll MOD = 1000000007>
class ModInt {
    ll n;
    ModInt constexpr inverse() const {
        return ModInt::pow(*this, MOD - 2);
    }

public:
    ModInt()
        : n(0) {}
    ModInt(ll _n)
        : n(((_n % MOD) + MOD) % MOD) {}
    ModInt operator+=(const ModInt &m) {
        n += m.n;
        if (n >= MOD) n -= MOD;
        return *this;
    }
    ModInt operator-=(const ModInt &m) {
        n -= m.n;
        if (n < 0) n += MOD;
        return *this;
    }
    ModInt operator*=(const ModInt &m) {
        n *= m.n;
        if (n >= MOD) n %= MOD;
        return *this;
    }
    ModInt operator/=(const ModInt &m) {
        (*this) *= m.inverse();
        return *this;
    }
    friend ModInt operator+(ModInt t, const ModInt &m) {
        return t += m;
    }
    friend ModInt operator-(ModInt t, const ModInt &m) {
        return t -= m;
    }
    friend ModInt operator*(ModInt t, const ModInt &m) {
        return t *= m;
    }
    friend ModInt operator/(ModInt t, const ModInt &m) {
        return t /= m;
    }
    ModInt operator=(const ll l) {
        n = l % MOD;
        if (n < 0) n += MOD;
        return *this;
    }
    friend ostream &operator<<(ostream &out, const ModInt &m) {
        out << m.n;
        return out;
    }
    friend istream &operator>>(istream &in, ModInt &m) {
        ll l;
        in >> l;
        m = l;
        return in;
    }
    static constexpr ModInt pow(const ModInt x, ll p) {
        ModInt<MOD> ans = 1;
        for (ModInt<MOD> m = x; p > 0; p /= 2, m *= m) {
            if (p % 2) ans *= m;
        }
        return ans;
    }
};
using mint = ModInt<>;
mint operator"" _m(unsigned long long m) {
    return mint(m);
}

#include <queue>

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, k;
    cin, n, k;
    priority_queue<ll> p, m;
    vector<ll> mTmp;
    int zeros = 0;
    REP(i, 0, n) {
        int a;
        cin, a;
        if (a > 0) {
            p.push(a);
        } else if (a < 0) {
            m.push(-a);
            mTmp.push_back(-a);
        } else {
            zeros++;
        }
    }
    if (n - zeros < k) {
        print(0);
        return 0;
    }
    mint ans = 1;
    ll cm = 0;
    ll mlast = 0, plast = 0;
    REP(i, 0, k) {
        int ap = 0, am = 0;
        if (p.size() > 0) {
            ap = p.top();
        }
        if (m.size() > 0) {
            am = m.top();
        }
        if (ap < am) {
            ans *= am;
            m.pop();
            mlast = am;
            cm++;
        } else {
            ans *= ap;
            p.pop();
            plast = ap;
        }
    }
    if (cm % 2 == 0) {
        print(ans);
    } else {
        if (plast == 0) {
            if (p.size() > 0) {
                print(ans / mlast * p.top());
            } else {
                if (zeros > 0) {
                    print(0);
                } else {
                    ans = 1;
                    sort(mTmp.begin(), mTmp.end());
                    REP(i, 0, k) {
                        ans *= mTmp[i];
                    }
                    print(ans * -1);
                }
            }
        } else {
            ll aa = 0, bb = 0;
            if (p.size() > 0) {
                aa = plast * p.top();
            }
            if (m.size() > 0) {
                bb = mlast * m.top();
            }
            if (aa == 0 && bb == 0) {
                if (zeros > 1) {
                    print(0);
                } else {
                    print(ans * -1);
                }
            } else if (aa > bb) {
                print(ans / mlast * p.top());
            } else {
                print(ans / plast * m.top());
            }
        }
    }

    return 0;
}


Measured memory_bytes: 6508