/*
これを入れて実行
g++ code.cpp
./a.out
 */
 
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
#include <cassert>

#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
 
using namespace std;
typedef long long ll;
typedef long double ld;
 
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
 
const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;
 
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
    return f.second > s.second;
}
 
ll gcd(ll a, ll b){
	if (b == 0)return a;
	return gcd(b, a % b);
}
 
ll lcm(ll a, ll b){
    return a / gcd(a, b) * b;
}

ll conbinationMemo[100][100];

void cmemoInit(){
    rep(i, 100){
        rep(j, 100){
            conbinationMemo[i][j] = -1;
        }
    }
}
 
ll nCr(ll n, ll r){
    if(conbinationMemo[n][r] != -1) return conbinationMemo[n][r];
    if(r == 0 || r == n){
        return 1;
    } else if(r == 1){
        return n;
    }
    return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
 
ll nPr(ll n, ll r){
    r = n - r;
    ll ret = 1;
    for (ll i = n; i >= r + 1; i--) ret *= i;
    return ret;
}
//-----------------------ここから-----------
int main(void){
    ll n, k;
    cin >> n >> k;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];

    if(n == k){
        ll ans = 1;
        rep(i, n){
            ans *= a[i];
            ans %= MOD;
        }
        while(ans < 0) ans += MOD;
        cout << ans % MOD << endl;
        return 0;
    }

    sort(all(a), [](const ll &f, const ll &s){
        return abs(f) > abs(s);
    });

    vector<ll> plus, minus;
    rep(i, n){
        if(a[i] >= 0){
            plus.push_back(a[i]);
        } else {
            minus.push_back(a[i]);
        }
    }

    ll ans = 1;
    
    if(minus.size() == n && k % 2 != 0){
        sort(all(a), greater<ll>());
        rep(i, k){
            ans *= a[i];
            ans %= MOD;
        }
    } else {
        plus.clear();
        minus.clear();
        rep(i, k){
            if(a[i] >= 0){
                plus.push_back(a[i]);
            } else {
                minus.push_back(a[i]);
            }
        }
        if(minus.size() % 2 != 0){
            ll tmpp = INF;
            ll tmpm = INF;
            for(ll i = k; i < n; i++){
                if(a[i] >= 0){
                    tmpp = a[i];
                    break;
                }
            }
            for(ll i = k; i < n; i++){
                if(a[i] < 0){
                    tmpm = a[i];
                    break;
                }
            }
            if(plus.size() == 0 && tmpp != INF){
                plus.push_back(tmpp);
                minus.pop_back();
            } else if(minus.size() == 0 && tmpm != INF){
                minus.push_back(tmpm);
                plus.pop_back();
            } else {
                if((tmpm==INF?-INF:abs(minus.back()) * abs(tmpm)) > (tmpp==INF?-INF:abs(plus.back()) * abs(tmpp))){
                    plus.pop_back();
                    minus.push_back(tmpm);
                } else {
                    minus.pop_back();
                    plus.push_back(tmpp);
                }
            }

        }
        rep(i, plus.size()){
            ans *= plus[i];
            ans %= MOD;
        }
        rep(i, minus.size()){
            ans *= minus[i];
            ans %= MOD;
        }
    }
    while(ans < 0) ans += MOD;
    cout << ans % MOD << endl;




}


Measured memory_bytes: 6916