// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;

// ModInt begin

using ll = long long;
template<ll mod>
struct ModInt {
    ll v;
    ll mod_pow(ll x, ll n) const {
        return (!n) ? 1 : (mod_pow((x*x)%mod,n/2) * ((n&1)?x:1)) % mod;
    }
    ModInt(ll a = 0) : v((a %= mod) < 0 ? a + mod : a) {}
    ModInt operator+ ( const ModInt& b ) const {
        return (v + b.v >= mod ? ModInt(v + b.v - mod) : ModInt(v + b.v));
    }
    ModInt operator- () const {
        return ModInt(-v);
    }
    ModInt operator- ( const ModInt& b ) const {
        return (v - b.v < 0 ? ModInt(v - b.v + mod) : ModInt(v - b.v));
    }
    ModInt operator* ( const ModInt& b ) const {return (v * b.v) % mod;}
    ModInt operator/ ( const ModInt& b ) const {return (v * mod_pow(b.v, mod-2)) % mod;}
    
    bool operator== ( const ModInt &b ) const {return v == b.v;}
    bool operator!= ( const ModInt &b ) const {return !(*this == b); }
    ModInt& operator+= ( const ModInt &b ) {
        v += b.v;
        if(v >= mod) v -= mod;
        return *this;
    }
    ModInt& operator-= ( const ModInt &b ) {
        v -= b.v;
        if(v < 0) v += mod;
        return *this;
    }
    ModInt& operator*= ( const ModInt &b ) {
        (v *= b.v) %= mod;
        return *this;
    }
    ModInt& operator/= ( const ModInt &b ) {
        (v *= mod_pow(b.v, mod-2)) %= mod;
        return *this;
    }
    ModInt pow(ll x) { return ModInt(mod_pow(v, x)); }
    // operator int() const { return int(v); }
    // operator long long int() const { return v; }
};

template<ll mod>
ModInt<mod> pow(ModInt<mod> n, ll k) {
    return ModInt<mod>(n.mod_pow(n.v, k));
}

template<ll mod>
ostream& operator<< (ostream& out, ModInt<mod> a) {return out << a.v;}
template<ll mod>
istream& operator>> (istream& in, ModInt<mod>& a) {
    in >> a.v;
    return in;
}

// ModInt end
using mint = ModInt<MOD>;

int main() {
    int N, K; cin >> N >> K;

    vector<ll> A(N);
    for(int i=0; i<N; i++) cin >> A[i];

    sort(A.begin(), A.end(), [](ll a, ll b) {
            return abs(a) > abs(b);
        });

    ll plus = 0, minus = 0;
    mint mul(1);
    for(int i=0; i<K; i++) {
        if(A[i] < 0) minus++;
        if(A[i] > 0) plus++;
        if(A[i] == 0) {
            puts("0");
            return 0;
        }
        mul *= mint(A[i]);
    }

    if(minus % 2 == 0 or N == K) {
        cout << mul << endl;
        return 0;
    }

    int nega = 0;
    for(auto e : A) if(e < 0) nega++;
    if(nega == N) {
        sort(A.rbegin(), A.rend());
        mul = mint(1);
        for(int i=0; i<K; i++) {
            mul *= mint(A[i]);
        }
        cout << mul << endl;
        return 0;
    }

    // plus の中で最も小さいものを、K 個範囲外の minus と交換
    // minus の中で最も小さいものを、K 個範囲外の plus と交換
    mint ans = mul;
    ll a1 = -1, b1 = -1;
    if(plus > 0) {
        ll min_v = LONGINF;
        for(int i=0; i<K; i++) {
            if(A[i] <= 0) continue;
            chmin(min_v, abs(A[i]));
        }
        a1 = min_v;
        
        ll max_v = -LONGINF;
        for(int i=K; i<N; i++) {
            if(A[i] > 0) continue;
            chmax(max_v, abs(A[i]));
        }
        b1 = max_v;
    }
    ll a2 = -1, b2 = -1;
    if(minus > 0) {        
        ll min_v = LONGINF;
        for(int i=0; i<K; i++) {
            if(A[i] >= 0) continue;
            chmin(min_v, abs(A[i]));
        }
        a2 = min_v;
        
        ll max_v = -LONGINF;
        for(int i=K; i<N; i++) {
            if(A[i] < 0) continue;
            chmax(max_v, abs(A[i]));
        }
        b2 = max_v;
    }

    if(a1 >= 0 and a2 >= 0 and b1 >= 0 and b2 >= 0) {
        ans *= mint(-1);
        
        // a1, b1
        if(b1*a2 > b2*a1) {
            ans /= mint(a1);
            ans *= mint(b1);
        }
        // a2, b2
        else {
            ans /= mint(a2);
            ans *= mint(b2);
        }
    }
    else if(a1 >= 0 and b1 >= 0) {
        ans *= mint(-1);

        ans /= mint(a1);
        ans *= mint(b1);
    }
    else if(a2 >= 0 and b2 >= 0) {
        ans *= mint(-1);

        ans /= mint(a2);
        ans *= mint(b2);
    }

    cout << ans << endl;
    return 0;
}


Measured memory_bytes: 4852