#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
using namespace std; using ll = long long; using ld = long double;  using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using vpll = vector<pll>;
using vs = vector<string>; using tll = tuple<ll, ll, ll>; using vtll = vector<tll>;
const ld PI = 3.1415926535897932;
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define co(i) cout << i << endl;
#define co2(i,j) cout << i << " " << j << endl;
#define co3(i) cout << i << " ";
#define po(i) cout << i.first << " " << i.second << endl;
void in() {}
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
	cerr << " " << h;
	if (sizeof...(t) > 0) cerr << " :";
	debug_out(t...);
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> vec) {
	for (size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	return os;
}
ll ctoi(char c) {
	switch (c) {
	case '0': return 0; case '1': return 1; case '2': return 2;
	case '3': return 3; case '4': return 4; case '5': return 5;
	case '6': return 6; case '7': return 7; case '8': return 8;
	case '9': return 9;  default: return 0;
	}
}
bool pairCompare(const pll firstElof, pll secondElof)
{
	return firstElof.first > secondElof.first;
}
//**Snippetリスト**//
//rep, vin, all, iteLoop, bitSearch, bitList, nod, digitDP, treeDP//
//gcdlcm, isPrime, eratos, primeFactorize, Npow, combination, divisor, modinv, doubling//
//dfs, bfs, dijkstra, WarshallFloyd, BellmanFord, UnionFind, Kruskal, RMQ, LCA//
ll i, j, k, l; ll N, M, K, H, W, L, X, Y, Z, R, Q;
ll MOD = 1000000007, INF = 1LL << 60, ans = 0, z = 0, o = 1;
vl flag, D; vll path;
//***********//
int main() {
	cin >> N >> K;
	ll K2 = K;
	vl A(N);
	vl P, Q;
	ll zero = 0;
	for (i = 0; i < N; i++) {
		cin >> A[i];
		if (A[i] > 0) {
			P.push_back(A[i]);
		}
		else if (A[i] < 0) {
			Q.push_back(-A[i]);
		}
		else {
			zero++;
		}
	}
	sort(P.begin(), P.end());
	sort(Q.begin(), Q.end());
	reverse(P.begin(), P.end());
	reverse(Q.begin(), Q.end());
	//debug(P, Q);
	ll X = P.size();
	ll Y = Q.size();
	vl sumP(X + 1,1);
	vl sumQ(Y + 1, 1);
	queue<ll> Pd, Qd;
	for (i = 0; i < X-1; i+=2) {
		Pd.push(P[i] * P[i + 1]);
	}
	for (i = 0; i < Y-1; i+=2) {
		Qd.push(Q[i] * Q[i + 1]);
	}
	ll ans = 1;
	ll last = 0;
	ll last2 = 0;
	while (K>=2) {
		//+++と+--を見極める特殊パターン
		if (last+2 < X && Qd.size() > 0 && K == 3) {
			(ans *= P[last]) %= MOD;
			if (Qd.front() >= P[last + 1] * P[last + 2]) {
				ll R = (Qd.front()) % MOD;
				(ans *= R) %= MOD;
			}
			else {
				ll R = (P[last + 1] * P[last + 2]) % MOD;
				(ans *= R) %= MOD;
			}
			co(ans);
			exit(0);
		}
		else if (Pd.size() > 0 && Qd.size() > 0) {
			if (Pd.front() <= Qd.front()) {
				ll R = (Qd.front()) % MOD;
				(ans *= R) %= MOD;
				Qd.pop();
				K -= 2;
				last2 += 2;
			}
			else {
				ll R = (Pd.front()) % MOD;
				(ans *= R) %= MOD;
				Pd.pop();
				K -= 2;
				last += 2;
			}
		}
		else if (Pd.size() > 0) {
			ll R = (Pd.front()) % MOD;
			(ans *= R) %= MOD;
			Pd.pop();
			K -= 2;
			last += 2;
		}
		else if (Qd.size() > 0) {
			ll R = (Qd.front()) % MOD;
			(ans *= R) %= MOD;
			Qd.pop();
			K -= 2;
			last2 += 2;
		}
		else break;
	}
	//debug(ans);
	if (K > 0) {
		if (last < X) {
			(ans *= P[last]) %= MOD;
			K--;
		}
	}
	while (K > 0 && zero > 0) {
		ans = 0;
		K--;
		co(ans);
		exit(0);
	}
	if (K > 0) {
		// 負確定パターン
		A[i] = abs(A[i]);
		sort(A.begin(), A.end());
		ans = 1;
		ll now1 = 0, now2 = 0;
		sort(P.begin(), P.end());
		sort(Q.begin(), Q.end());
		P.push_back(INF);
		Q.push_back(-INF);
		//debug(P, Q);
		while (K2 > 0) {
			if (abs(P[now1] <= abs(Q[now2]))) {
				(ans *= P[now1]) %= MOD;
				now1++;
			}
			else {
				(ans *= -Q[now2]) %= MOD;
				now2++;
			}
			K2--;
		}
	}
	co((ans+MOD)%MOD);
}

Measured memory_bytes: 9112