#pragma GCC optimize ("O3")
// #pragma GCC target ("avx")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>

using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)

template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {
    for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); }
    putchar('\n');
}
template<unsigned MOD_> struct ModInt {
    static constexpr unsigned MOD = MOD_;
    unsigned x;
    void undef() { x = (unsigned)-1; }
    bool isnan() const { return x == (unsigned)-1; }
    inline int geti() const { return (int)x; }
    ModInt() { x = 0; }
    ModInt(const ModInt &y) { x = y.x; }
    ModInt(int y) { if (y<0 || (int)MOD<=y) y %= (int)MOD; if (y<0) y += MOD; x=y; }
    ModInt(unsigned y) { if (MOD<=y) x = y % MOD; else x = y; }
    ModInt(long long y) { if (y<0 || MOD<=y) y %= MOD; if (y<0) y += MOD; x=y; }
    ModInt(unsigned long long y) { if (MOD<=y) x = y % MOD; else x = y; }
    ModInt &operator+=(const ModInt y) { if ((x += y.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(const ModInt y) { if ((x -= y.x) & (1u<<31)) x += MOD; return *this; }
    ModInt &operator*=(const ModInt y) { x = (unsigned long long)x * y.x % MOD; return *this; }
    ModInt &operator/=(const ModInt y) { x = (unsigned long long)x * y.inv().x % MOD; return *this; }
    ModInt operator-() const { return (x ? MOD-x: 0); }

    ModInt inv() const { return pow(MOD-2); }
    ModInt pow(long long y) const {
	ModInt b = *this, r = 1;
	if (y < 0) { b = b.inv(); y = -y; }
	for (; y; y>>=1) {
	    if (y&1) r *= b;
	    b *= b;
	}
	return r;
    }

    friend ModInt operator+(ModInt x, const ModInt y) { return x += y; }
    friend ModInt operator-(ModInt x, const ModInt y) { return x -= y; }
    friend ModInt operator*(ModInt x, const ModInt y) { return x *= y; }
    friend ModInt operator/(ModInt x, const ModInt y) { return x *= y.inv(); }
    friend bool operator<(const ModInt x, const ModInt y) { return x.x < y.x; }
    friend bool operator==(const ModInt x, const ModInt y) { return x.x == y.x; }
    friend bool operator!=(const ModInt x, const ModInt y) { return x.x != y.x; }
};

constexpr LL MOD = 1000000007;
// constexpr LL MOD = 998244353;
using Mint = ModInt<MOD>;

int N, K;
vector<LL> PO, NE;
int zero;

void MAIN() {
    scanf("%d%d", &N, &K);

    REP (i, N) {
	int x;
	scanf("%d", &x);
	if (x < 0) NE.push_back(x);
	else if (x > 0) PO.push_back(x);
	else zero++;
    }

    Mint ans;
    int mi = min((int)NE.size()/2, K/2);
    int rest = K - mi * 2;
    if ((int)PO.size() >= rest) {
	while ((int)PO.size() < K) PO.push_back(0);
	sort(PO.begin(), PO.end());
	reverse(PO.begin(), PO.end());
	PO.resize(K);
	reverse(PO.begin(), PO.end());

	sort(NE.begin(), NE.end());

	//rprintf("%lld", PO.begin(), PO.end());
	//rprintf("%lld", NE.begin(), NE.end());

	int best = 0;
	for (int b=0; b+2<=(int)NE.size() && b+2<=K; b+=2) {
	    LL g = PO[b] * PO[b+1];
	    LL h = NE[b] * NE[b+1];
	    if (g < h) best = b + 2;
	}

	ans = 1;
	for (int i=best; i<K; i++) ans *= PO[i];
	REP (i, best) ans *= NE[i];
    } else if (zero) {
	ans = 0;
    } else if ((int)NE.size() + (int)PO.size() == K) {
	ans = 1;
	EACH (e, PO) ans *= *e;
	EACH (e, NE) ans *= *e;
    } else {
	assert(PO.empty());
	sort(NE.begin(), NE.end());
	reverse(NE.begin(), NE.end());
	ans = 1;
	REP (i, K) ans *= NE[i]; 
    }
    printf("%d\n", ans.geti());
}

int main() {
    int TC = 1;
//    scanf("%d", &TC);
    REP (tc, TC) MAIN();
    return 0;
}



Measured memory_bytes: 7900