#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;

void solve() {
	int N, K; cin >> N >> K;
	vector<int>A(N);
	bool zero = false;
	REP(i, N) {
		cin >> A[i];
		if (A[i] == 0)zero = true;
	}
	sort(all(A), [](const int &a, const int &b) {
		if (abs(a) != abs(b))return abs(a) > abs(b);
		else return a > b;
	});
	int c = 0;
	REP(i, K)if (A[i] < 0)c++;
	ll res = 1;


	if (c % 2 == 0) {
		REP(i, K) {
			res *= abs(A[i]);
			res %= MOD;
		}
		res %= MOD;
	}
	else {
		int rp = N, rm = N, lp = -1, lm = -1;
		FORR(i, N, K) {
			if (A[i] > 0)rp = i;
			if (A[i] < 0)rm = i;
		}
		REP(i, K) {
			if (A[i] > 0)lp = i;
			if (A[i] < 0)lm = i;
		}
		if (rp != N && rm != N && lp != -1 && lm != -1) {
			int a = abs(A[lm]);
			int b = abs(A[rp]);
			int x = abs(A[lp]);
			int y = abs(A[rm]);
			//ab
			if (x*b > a*y) {
				REP(i, K) {
					if (i != lm)res *= abs(A[i]);
					res %= MOD;
				}
				res *= abs(A[rp]);
				res %= MOD;
			}
			else {
				REP(i, K) {
					if(i!=lp)res *= abs(A[i]);
					res %= MOD;
				}
				res *= abs(A[rm]);
				res %= MOD;
			}
		}
		else if (rp != N && lm != -1) {
			REP(i, K) {
				if (i != lm)res *= abs(A[i]);
				res %= MOD;
			}
			res *= abs(A[rp]);
			res %= MOD;
		}
		else if (rm != N && lp != -1) {
			REP(i, K) {
				if (i != lp)res *= abs(A[i]);
				res %= MOD;
			}
			res *= abs(A[rm]);
			res %= MOD;
		}
		else if (zero) {
			res = 0;
		}
		else {
			//print("a");
			FORR(i, N,N-K) {
				res *= abs(A[i]);
				res %= MOD;
			}
			//DEBUG(res);
			res *= (MOD-1);
			res %= MOD;
		}
	}
	print(res);
}



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	//int q;
	//cin >> q;
	//while (q--)
	solve();
}


Measured memory_bytes: 4796