#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
#include <functional>

#ifdef LOCAL
    #define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
    #define eprintf(...) 42
#endif

#define rep_(i, a_, b_, a, b, ...) for (int i = (a), i##_len = (b); i < i##_len; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define reprev_(i, a_, b_, a, b, ...) for (int i = (b-1), i##_min = (a); i >= i##_min; --i)
#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
// template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair <int,int> P;
typedef long double ld;

constexpr int MOD = 1000000007;

// + - * / ^
int mod(int a)
{
    int res = a % MOD;
    if(res < 0) {
        return res + MOD;
    }
    return res;
}
int mul_mod(int a, int b)
{
    ll res = ((ll)a * (ll)b) % MOD;
    return mod((int)res);
}
int pow_mod(int a, int b)
{
    ll res = 1;
    while (b > 0) {
        if(b & 1) {
            res = res * (ll)a % (ll)MOD;
        }
        a = mul_mod(a, a);
        b >>= 1;
    }
    return (int)res;
}
int inv_mod(int a)
{
    return pow_mod(a, MOD - 2);
}
int div_mod(int a, int b)
{
    return mul_mod(a, inv_mod(b));
}

// ! C
constexpr int FAC_MAX = 3000001;
ll fac[FAC_MAX], finv[FAC_MAX], inv[FAC_MAX];
void com_init()
{
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < FAC_MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
ll com_mod(int a, int b){
    if (a < b) return 0;
    if (a < 0 || b < 0) return 0;
    return fac[a] * (finv[b] * finv[a - b] % MOD) % MOD;
}


int main (void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ll MOD = (ll)1e9 + 7;
    int n, k; cin >> n >> k;
    vector<ll> a(n); rep (i, n) cin >> a[i];
    vector<ll> pl, mn;
    rep (i, n) {
        if (a[i] > 0) pl.push_back(a[i]);
        else if (a[i] < 0) mn.push_back(-a[i]);
    }
    sort(all(a), [](int a, int b){return abs(a) > abs(b);});
    sort(all(pl)); reverse(all(pl));
    sort(all(mn)); reverse(all(mn));
    ll last_pl = 0, last_mn = 0, ans = 1;
    int pl_count = 0, mn_count = 0;
    rep (i, k) {
        if (a[i] > 0) {
            last_pl = a[i];
            pl_count++;
        } else if (a[i] < 0) {
            last_mn = -a[i];
            mn_count++;
        }
        ans = mul_mod(ans, abs(a[i]));
    }

    eprintf("%d %d\n", pl_count, mn_count);
    bool ok = false;
    rep (i, k + 1) {
        int p = i, m = k - i;
        if (p > pl.size() || m > mn.size() || m % 2 == 1) continue;
        ok = true;
        break;
    }
    if (ok) { // plus ni dekiru
        eprintf("*");
        if (mn_count % 2 == 0) {
            cout << ans << "\n";
        } else {
            if (pl_count > 0 && mn_count > 0) {
                ans = div_mod(ans, pl[--pl_count]);
                ans = div_mod(ans, mn[--mn_count]);
                eprintf("%d %d\n", pl_count, mn_count);
                eprintf("%lld\n", ans);
                if (mn_count + 2 > mn.size()) {
                    eprintf("A");
                    ans = mul_mod(mul_mod(ans, pl[pl_count]), pl[pl_count + 1]);
                } else if (pl_count + 2 > pl.size()) {
                    eprintf("B");
                    ans = mul_mod(mul_mod(ans, mn[mn_count]), mn[mn_count + 1]);
                } else {
                    eprintf("C");
                    ll M = max(pl[pl_count] * pl[pl_count + 1], mn[mn_count] * mn[mn_count + 1]) % MOD;
                    ans = mul_mod(ans, M);
                }
                cout << ans << "\n";
            } else {
                if (pl_count == 0) {
                    ans = div_mod(ans, mn[--mn_count]);
                    ans = mul_mod(ans, pl[pl_count]);
                }
                cout << ans << "\n";
            }
        }
    } else { // dekinai
        if (pl.size() + mn.size() < n) { // 0 ni dekiru
            cout << 0 << "\n";
        } else {
            reverse(all(a));
            ll ans = 1;
            rep (i, k) ans = (MOD + (ans * a[i]) % MOD) % MOD;
            cout << ans << "\n";
        }
    }
    
    return 0;
}

Measured memory_bytes: 6916