#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<int, int>;
using Edge = pair<int, ll>;
using Graph = vector<vector<int>>;
using WeightedGraph = vector<vector<Edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD = 1000000007;

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; swap(a, b);
            u -= t * v; 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 ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {
        return is >> x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};

template<class T> struct BiCoef {
    vector<T> fact_, inv_, finv_;
    constexpr BiCoef() {}
    constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
        init(n);
    }
    constexpr void init(int n) noexcept {
        fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
        int MOD = fact_[0].getmod();
        for(int i = 2; i < n; i++){
            fact_[i] = fact_[i-1] * i;
            inv_[i] = -inv_[MOD%i] * (MOD/i);
            finv_[i] = finv_[i-1] * inv_[i];
        }
    }
    constexpr T com(int n, int k) const noexcept {
        if (n < k || n < 0 || k < 0) return 0;
        return fact_[n] * finv_[k] * finv_[n-k];
    }
    constexpr T fact(int n) const noexcept {
        if (n < 0) return 0;
        return fact_[n];
    }
    constexpr T inv(int n) const noexcept {
        if (n < 0) return 0;
        return inv_[n];
    }
    constexpr T finv(int n) const noexcept {
        if (n < 0) return 0;
        return finv_[n];
    }
};

using mint = Fp<MOD>;


int main() {
	ll N, K; cin >> N >> K;
	vector<ll> a(N);
	ll pos_num = 0, neg_num = 0;
	for (int i = 0; i < N; i++)
	{
		cin >> a[i];
		if (a[i] > 0) ++pos_num;
		if (a[i] < 0) ++neg_num;
	}

	bool f = true;
	if (min(K - K % 2, neg_num - neg_num % 2) + pos_num < K) f = false;

	sort(a.begin(), a.end());

	// 正の数で大きいのを目指す
	mint ans = 1;
	if (f) {
		int l = 0, r = N - 1;
		for (int num = 0; num < K;) {
			ll tmp_l = a[l] * a[l + 1];
			ll tmp_r = a[r] * a[r - 1];
			if (tmp_l < tmp_r || num == K - 1) {
				ans *= a[r];
				--r;
				++num;
			}
			else {
				ans *= tmp_l;
				l += 2;
				num += 2;
			}
		}
	}
	// 負の数で大きいのを目指す
	else {
		if (pos_num + neg_num != N) {
			cout << 0 << endl;
			return 0;
		}
		int idx_c = lower_bound(a.begin(), a.end(), 0) - a.begin();
		int l = idx_c - 1, r = idx_c;
		for (int num = 0; num < K;) {
			if (r >= N) {
				ans *= a[l]; --l; ++num;
			}
			else if (l < 0) {
				ans *= a[r]; ++r; ++num;
			}
			else {
				if (abs(a[l]) < abs(a[r])) {
					ans *= a[l]; --l; ++num;
				}
				else {
					ans *= a[r]; ++r; ++num;
				}
			}
		}
	}
	cout << ans << endl;

}

Measured memory_bytes: 4804