#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % mod;
		x = x * x % mod; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

void solve() {
	int n, k; cin >> n >> k;
	vector<ll> a(n);
	rep(i, n)cin >> a[i];
	
	bool exizero = false;
	rep(i, n)if (a[i] == 0) {
		exizero = true;
	}
	vector<ll> pos, neg;
	rep(i, n) {
		if (a[i] > 0)pos.push_back(a[i]);
		else if (a[i] < 0)neg.push_back(-a[i]);
	}
	sort(all(pos));
	sort(all(neg));
	

	int cneg = -1;
	for (int i = 0; i <= k; i += 2) {
		if (i <= neg.size() && k - i <= pos.size()) {
			if (cneg < 0) {
				cneg = i;
			}
			else {
				ll le = neg[neg.size() - i] * neg[neg.size() - i + 1];
				ll ri = pos[pos.size() - (k - i) - 2] * pos[pos.size() - (k - i) - 1];
				if (le > ri) {
					cneg = i;
				}
				else break;
			}
		}
	}
	if (cneg >= 0) {
		modint ans = 1;
		rep(i, cneg) {
			ans *= neg[neg.size() - 1 - i];
		}
		rep(i, k - cneg) {
			ans *= pos[pos.size() - 1 - i];
		}
		cout << ans << "\n";
	}
	else {
		if (exizero) {
			cout << 0 << "\n";
		}
		else {
			for (int i = 1; i <= k; i += 2) {
				if (i <= neg.size() && k - i <= pos.size()) {
					if (cneg < 0) {
						cneg = i;
					}
					else {
						ll le = neg[i - 2] * neg[i - 1];
						ll ri = pos[k - i] * pos[k - i + 1];
						if (le < ri) {
							cneg = i;
						}
						else break;
					}
				}
			}
			modint ans = -1;
			rep(i, cneg) {
				ans *= neg[i];
			}
			rep(i, k - cneg) {
				ans *= pos[i];
			}
			
			cout << ans << "\n";
		}
	}
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}


Measured memory_bytes: 23384