// abc173_e
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;

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

#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))
#define ALL(x) x.begin(), x.end()

#define INF (ll)(1e9)
#define MOD (1000000007)

#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << " "; cout << endl; }
#define print_line(vec, n) {for(int i=0;i<(n-1);i++) cout << (vec)[i] << " "; cout << (vec)[(n)-1] << endl;}
template<class T> void print(const T& x){cout << x << endl;}
template<class T, class... A> void print(const T& first, const A&... rest) { cout << first << " "; print(rest...); }
struct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain;


const int mod = 1e9 + 7;
struct mint {
    ll x;
    mint(ll a=0){x = a>=0 ? a%mod : mod-(-a)%mod;}
    mint(const mint& m):x(m.x){}
    mint& operator+=(const mint& a) { if ((x += a.x) >= mod) x -= mod; return *this; }
    mint& operator+=(const int& a) { if ((x += a) >= mod) x -= mod; return *this; }
    mint& operator-=(const mint& a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; }
    mint& operator-=(const int& a) { if ((x += mod-a) >= mod) x -= mod; return *this; }
    mint& operator*=(const mint& a) { (x *= a.x) %= mod; return *this; }
    mint& operator*=(const int& a) { (x *= a) %= mod; return *this; }
    mint operator+(const mint& a) const { mint res(*this); return res+=a; }
    mint operator+(const int& a) const { mint res(*this); return res+=a; }
    mint operator-(const mint& a) const { mint res(*this); return res-=a; }
    mint operator-(const int& a) const { mint res(*this); return res-=a; }
    mint operator-() const {mint res(*this); return mint(0)-res;}
    mint operator*(const mint& a) const { mint res(*this); return res*=a; }
    mint operator*(const int& a) const { mint res(*this); return res*=a; }
    bool operator==(const mint& a) const { return x == a.x;}
    bool operator==(const int& a) const { return x == a;}
    bool operator!=(const mint& a) const { return x != a.x;}
    bool operator!=(const int& a) const { return x != a;}
    operator bool() const {return x>0;}

    mint pow(ll t) const {mint r=1,a=*this; do{if(t&1)r*=a;a*=a;}while(t>>=1);return r;}
    mint pow(mint t) const {mint r=1,a=*this; do{if(t.x&1)r*=a;a*=a;}while(t.x>>=1);return r;}
    mint inv() const { return pow(mod-2); }
    mint& operator/=(const mint& a) { return (*this) *= a.inv(); }
    mint& operator/=(const int& a) { return (*this) *= mint(a).inv(); }
    mint operator/(const mint& a) const { mint res(*this); return res/=a; }
    mint operator/(const int& a) const { mint res(*this); return res/=a; }

    friend ostream& operator<<(ostream& os, const mint& m) {cout << m.x; return os;}
    friend istream& operator>>(istream& is, mint& m) { return is >> m.x; }
};

int main() {
#ifdef LOCAL
    ifstream in("../arg.txt"); cin.rdbuf(in.rdbuf());
#endif

    int N, K;
    cin >> N >> K;
    vector<int> A(N);
    REP(i, N) cin >> A[i];

    sort(ALL(A), [](int a, int b){ return abs(a) > abs(b);});
//    print(A);

    ll sign = 1;
    int min_p = -1;
    int min_m = -1;
    int inc_p = -1;
    int inc_m = -1;
    REP(i, N){

        if (i < K){
            if (A[i] > 0){
                min_p = i;
                sign *= 1;
            } else if (A[i] < 0){
                min_m = i;
                sign *= -1;
            } else {
                sign = 0;
            }
        } else {
            if (sign >= 0){
                break;
            }

            if (min_m != -1 && inc_p == -1 && A[i] > 0){
                inc_p = i;
            }

            if (min_p != -1 && inc_m == -1 && A[i] < 0){
                inc_m = i;
            }
        }
    }

    mint ans = 1;
    REP(i, K) ans *= abs(A[i]);

    if (sign == 0){
        ans = 0;
    } else if (sign > 0){ // 何もしなくて良い
        ;
    } else {
        if (inc_p != -1 && inc_m != -1) {
//            print("a");
            mint a = ans * abs(A[inc_p]) / abs(A[min_m]);
            mint b = ans * abs(A[inc_m]) / abs(A[min_p]);
            if ((ll)abs(A[inc_p]) * abs(A[min_p]) >= (ll)abs(A[inc_m]) * abs(A[min_m])) {
                ans = a;
            } else {
                ans = b;
            }
        } else if (inc_p != -1) {
//            print("b");
            mint a = ans * abs(A[inc_p]) / abs(A[min_m]);
            ans = a;
        } else if (inc_m != -1){
//            print("c");
            mint b = ans * abs(A[inc_m]) / abs(A[min_p]);
            ans = b;
        } else { //
//            print("d");
            ans = 1;
            REP(i, K) ans *= mint(A[N-i-1]);
        }
    }
    print(ans);

    return 0;
}


Measured memory_bytes: 3972