//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#ifdef DEBUG
#include "./Lib/debug_VC.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

/* constant value */
constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;

//=============================================================================================;

auto solve(ll n, ll k, const VL& a) {
	priority_queue<ll> qp;
	priority_queue<ll> qm;
	REPC(x, a) {
		((x > 0) ? qp : qm).emplace(std::abs(x));
	}
	auto mm = [&]() {
		if (qm.size() > 1) {
			ll a = qm.top();
			qm.pop();
			ll b = qm.top();
			qm.pop();
			return  (a * b);
		}
		return 0LL;
	};
	auto pm = [&]() {
		if (!qp.empty()) {
			ll a = qp.top();
			qp.pop();
			return  a;
		}
		return 0LL;
	};
	if (qp.empty()) {
		ll ans = 1;
		auto t = a;
		if (k & 1) {
			rsort(t);
		} else {
			sort(t);
		}
		REP(i, k) {
			ans *= std::abs(t[i]);
			ans %= MOD;
		}
		if (k & 1) { ans = (MOD - ans); }
		return (ans % MOD);
	}
	if (k == n) {
		ll sz = qm.size();
		ll ans = 1;
		while (!qm.empty()) {
			ll v = qm.top();
			qm.pop();
			ans *= std::abs(v);
			ans %= MOD;
		}
		if (sz & 1) { ans = MOD - ans; }
		while (!qp.empty()) {
			ll v = qp.top();
			qp.pop();
			ans *= std::abs(v);
			ans %= MOD;
		}
		return (ans % MOD);
	}

	ll ad = mm();
	ll pd = pm();

	ll ans = 1;
	ll cnt = 0;
	while (cnt < k) {
		if (qp.empty() && !((k - cnt) & 1)) {
			ans *= (ad % MOD);
			ans %= MOD;
			cnt += 2;
			ad = mm();
		} else if (cnt + 2 <= k && !qp.empty() && ad >= pd * qp.top()) {
			ans *= (ad % MOD);
			ans %= MOD;
			cnt += 2;
			ad = mm();
		} else {
			ans *= pd;
			ans %= MOD;
			++cnt;
			pd = pm();
		}
	}
	return (ans % MOD);
}

auto solve_c(ll n, ll k, const VL& a) {
	ll ans = -10000000000;
	REP(i, (1 << n)) {
		ll cnt = 0;
		REP(j, n)if ((i >> j) & 1) { ++cnt; }
		if (cnt != k) { continue; }
		ll tmp = 1;
		REP(j, n)if ((i >> j) & 1) {
			tmp *= a[j];
		}
		chmax(ans, tmp);
	}
	return (ans >= 0) ? ans : MOD + ans;
}

signed main() {
	/**/
	ll n, k;
	cin >> n >> k;
	VL a(n);
	cin >> a;

	auto ans = solve(n, k, a);
	cout << ans << endl;

	/*/
	auto gen = Sample::SampleGenerator();
	REP(_, 100) {
		auto [n] = gen.generate(PAIR{5,10});
		auto [k] = gen.generate(PAIR{1,n});
		auto [a] = gen.generate(V<PAIR>(n, PAIR{-9,9}));

		auto ans = solve(n, k, a);
		auto ans_c = solve_c(n, k, a);
		if (ans != ans_c) {
			cout << n << " " << k << endl;
			REPC(x, a) {
				cout << x << " ";
			}BR();
			dump(ans, ans_c);
			return 0;
		}
	}
	cout << "fin" << endl;
	/**/
}




Measured memory_bytes: 7736