////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include "bits/stdc++.h"
using namespace std;

#ifdef _MSC_VER
#include <fcntl.h>
#include <io.h>
#endif

// -- typedefs -- //
#define EPS 1e-9
typedef long long llong;

// -- loop macros -- //
#define LOOP_TYPE(s,n) std::remove_reference_t<std::remove_cv_t<decltype((n)-(s))>>
#define FOR(i,s,n)  for (auto i = LOOP_TYPE(s,n)(s);   i < LOOP_TYPE(s,n)(n);   i++)
#define FORR(i,s,n) for (auto i = LOOP_TYPE(s,n)(n)-1; i != LOOP_TYPE(s,n)(s)-1; i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) FORR(i,0,n)

#define FORE(exp) for (auto && exp)
#define allof(c) begin(c), end(c)
#define partof(c,s,e) begin(c) + (s), begin(c) + (e)

// -- functors -- //
#define PREDICATE(t,a,...) [&](const t & a) -> bool { return __VA_ARGS__; }
#define PRED(a,...) PREDICATE(auto,a,__VA_ARGS__)
#define COMPARISON(t,a,b,...) [&](const t & a, const t & b) -> bool { return __VA_ARGS__; }
#define COMP(a,b,...) COMPARISON(auto,a,b,__VA_ARGS__)
#define CONV1(a,...) [&](const auto & a) -> auto { return __VA_ARGS__; }
#define CONV2(a,b,...) [&](const auto & a, const auto & b) -> auto { return __VA_ARGS__; }
#define CONV3(a,b,c,...) [&](const auto & a, const auto & b, const auto & c) -> auto { return __VA_ARGS__; }

#define TIE(...) auto tie() const { return std::tie(__VA_ARGS__); }
#define LESS(t) bool operator <(const t &rhs) const { return tie() < rhs.tie(); }
#define GREATER(t) bool operator >(const t &rhs) const { return tie() > rhs.tie(); }

// -- I/O Helper -- //
struct _Reader { istream& cin; template <class T> _Reader operator ,(T& rhs) { cin >> rhs; return *this; } };
struct _Writer { ostream& cout; const char* d{ " " }; bool f{}; template <class T> _Writer operator ,(const T& rhs) { cout << (f ? d : "") << rhs; f = 1; return *this; } };
#define READ(t,...) t __VA_ARGS__; (_Reader{cin}), __VA_ARGS__
#define WRITE(...) do { (_Writer{cout}), __VA_ARGS__; cout << "\n"; } while (false)
#ifdef _DEBUG
#define DEBUG(...) do { (_Writer{cerr}), "DEBUG -> ", __VA_ARGS__; cerr << "\n"; } while (false)
#else
#define DEBUG(...)
#endif

// -- vevector -- //
template <class T> struct vevector : vector<vector<T>> { vevector(size_t n = 0, size_t m = 0, const T& initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } };
template <class T> struct vevevector : vector<vevector<T>> { vevevector(size_t n = 0, size_t m = 0, size_t l = 0, const T& initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } };
template <class T> struct vevevevector : vector<vevevector<T>> { vevevevector(size_t n = 0, size_t m = 0, size_t l = 0, size_t k = 0, const T& initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } };

namespace std {
	template <class T1, class T2> istream& operator >> (istream& in, pair<T1, T2>& p) { in >> p.first >> p.second; return in; }
	template <class T1, class T2> ostream& operator << (ostream& out, const pair<T1, T2>& p) { out << p.first << " " << p.second; return out; }
}

template <class T> T read() { T t; cin >> t; return t; }
template <class T> vector<T> read(int n) { vector<T> v; REP(i, n) { v.push_back(read<T>()); } return v; }
template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i, n) v.push_back(read<T>(m)); return v; }
template <class T> vector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i, n) v.push_back(readjag<T>()); return v; }

template <class T> struct iter_range_t { T beg, end; };
template <class T> iter_range_t<T> iter_range(T beg, T end) { return iter_range_t<T>{beg, end}; }
template <class T> ostream& operator << (ostream& out, iter_range_t<T> v) { if (v.beg != v.end) { out << *v.beg++; while (v.beg != v.end) { out << " " << *v.beg++; } } return out; }
template <class T> ostream& operator << (ostream& out, const vector<T>& v) { return out << iter_range(allof(v)); }

// -- etc -- //
template <class T> T infinity_value();
template <> int infinity_value<int>() { return int(1) << 30; }
template <> llong infinity_value<llong>() { return llong(1) << 60; }
template <> double infinity_value<double>() { return 1e+300 * 1e+300; }
#define INF(T) infinity_value<T>()

inline int sign_of(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }
template <class TInt> bool in_range(TInt val, TInt min, TInt max) { return val >= min && val < max; }
template <> bool in_range<double>(double val, double min, double max) { return val - min > -EPS && val - max < EPS; }
template <class TInt> bool in_range2d(TInt x, TInt y, TInt w, TInt h) { return x >= 0 && x < w&& y >= 0 && y < h; }
vector<int> iotavn(int start, int count) { vector<int> r(count); iota(allof(r), start);	return r; }


//// start up ////
void solve();
int32_t main()
{
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout << fixed;
	cout << setprecision(std::numeric_limits<double>::max_digits10);

	solve();

	////	 for Google code jam
	//READ(int, testcases);
	//REP(i, testcases)
	//{
	//	cout << "Case #" << (i + 1) << ": ";
	//	solve();
	//}

	// for Google code jam interactive
	//#ifdef _MSC_VER
	//	_setmode(_fileno(stdout), _O_BINARY);
	//#endif
	//	
	//	READ(int, T, B);
	//	DEBUG("T,B = ", T, B);
	//	REP(i, T) solve(B);

	return 0;
}


////////////////////
//// template end
////////////////////

void solve()
{
	READ(int, N, K);
	auto A = read<llong>(N);

	vector<llong> p, n, z;
	FORE(a :A)
	{
		if (a > 0) { p.push_back(a); }
		else if (a < 0) { n.push_back(a); }
		else { z.push_back(a); }
	}
	std::sort(allof(p));
	std::sort(allof(n));
	std::reverse(allof(n));

	int ansType = 1;
	{
		int k = K;
		int pc = p.size();
		int nc = n.size();
		int zc = z.size();

		int ncnt = min(k, nc) / 2 * 2;
		k -= ncnt;
		nc -= ncnt;

		int pcnt = min(k, pc);
		k -= pcnt;
		pc -= pcnt;

		if (k == 0)
		{
			ansType = 1;
		}
		else if (k <= zc)
		{
			WRITE(0);
			return;
		}
		else
		{
			ansType = -1;
		}
	}
	const llong MOD = 1000000007;
	llong ans = 1;

	if (ansType > 0)
	{
		if (K % 2)
		{
			ans *= p.back();
			p.pop_back();
			K--;
			ans %= MOD;
		}

		while (K)
		{
			if (p.size() >= 2 && n.size() >= 2)
			{
				if (*(p.end() - 1) * *(p.end() - 2) > * (n.end() - 1) * *(n.end() - 2))
				{
					ans *= *(p.end() - 1);
					ans %= MOD;
					ans *= *(p.end() - 2);
					ans %= MOD;
					p.pop_back();
					p.pop_back();
					K -= 2;
				}
				else
				{
					ans *= (*(n.end() - 1) + MOD) % MOD;
					ans %= MOD;
					ans *= (*(n.end() - 2) + MOD) % MOD;
					ans %= MOD;
					n.pop_back();
					n.pop_back();
					K -= 2;
				}
			}
			else if (p.size() >= 2)
			{
				ans *= *(p.end() - 1);
				ans %= MOD;
				ans *= *(p.end() - 2);
				ans %= MOD;
				p.pop_back();
				p.pop_back();
				K -= 2;
			}
			else if (n.size() >= 2)
			{
				ans *= (*(n.end() - 1) + MOD) % MOD;
				ans %= MOD;
				ans *= (*(n.end() - 2) + MOD) % MOD;
				ans %= MOD;
				n.pop_back();
				n.pop_back();
				K -= 2;
			}
			else
			{
				assert(false);
			}
		}

		WRITE(ans);
	}
	else
	{
		std::reverse(allof(p));
		std::reverse(allof(n));

		while (K)
		{
			if (p.size()  && n.size() )
			{
				if (*(p.end() - 1) <= *(n.end() - 1))
				{
					ans *= *(p.end() - 1);
					ans %= MOD;
					p.pop_back();
					K -= 1;
				}
				else
				{
					ans *= (*(n.end() - 1) + MOD) % MOD;
					ans %= MOD;
					n.pop_back();
					K -= 1;
				}
			}
			else if (p.size())
			{
				ans *= *(p.end() - 1);
				ans %= MOD;
				p.pop_back();
				K -= 1;
			}
			else if (n.size())
			{
				ans *= (*(n.end() - 1) + MOD) % MOD;
				ans %= MOD;
				n.pop_back();
				K -= 1;
			}
			else
			{
				assert(false);
			}
		}
		WRITE(ans);
	}
}


Measured memory_bytes: 7952