#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:512000000")
#include<utility>
#include<iostream>
#include<fstream>
#include<vector>
#include<array>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<functional>
#include<random>
#include<climits>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<cassert>
#include<ccomplex>
#include<chrono>

#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("unroll-loops")
#define int128 __int128
#else
#define int128 long long
#endif

#define all(x) x.begin(), x.end()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
#define mp make_pair
#define X first
#define Y second

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
mt19937_64 gen(time(nullptr));

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

ll mod = 1e9 + 7;

namespace {
    ll mul(ll a, ll b) {
        ll val = a * b - (ll)((ld)a * b / mod) * mod;
        if (val < 0) val += mod;
        if (val >= mod) val -= mod;
        return val;
    }
    ll poww(ll a, ll b) {
        ll val = 1;
        a %= mod;
        while (b > 0) {
            if (b % 2) val = mul(a, val);
            a = mul(a, a);
            b >>= 1;
        }
        return val % mod;
    }
    ll inv(ll a) {
        return poww(a, mod - 2);
    }
}

ll const maxn = 5e5 + 5;

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("output.txt", "w", stdout);
    
    ll n, k; cin >> n >> k;
    vector<ll>a(n);
    bool is_pos = false;
    vector<ll> pos, neg;
    for (ll i = 0; i < n; i++) {
        cin >> a[i];
        if (a[i] >= 0) is_pos = true;
        if (a[i] >= 0)pos.emplace_back(a[i]);
        else neg.push_back(a[i]);
    }

    sort(all(pos));
    sort(all(neg));
    reverse(all(neg));

    ll ans = 1;
    if (k == n) {
        for (ll i = 0; i < n; i++) {
            ans *= a[i];
            ans %= mod; if (ans < 0) ans += mod;
        }
    } else {
        if (is_pos or k%2 == 0) {
            if (k % 2 == 0) {
                vector<ll> kek;
                for (ll i = (ll)pos.size() - 1; i > 0; i -= 2) {
                    kek.push_back(pos[i] * pos[i - 1]);
                }
                for (ll i = (ll)neg.size() - 1; i > 0; i -= 2) {
                    kek.push_back(neg[i] * neg[i - 1]);
                }
                sort(all(kek)); reverse(all(kek));
                for (ll i = 0; i < k/2; i++) {
                    ans = mul(ans, kek[i] % mod);
                }
            } else {
                ans = pos.back();
                pos.pop_back();
                vector<ll> kek;
                for (ll i = (ll)pos.size() - 1; i > 0; i -= 2) {
                    kek.push_back(pos[i] * pos[i - 1]);
                }
                for (ll i = (ll)neg.size() - 1; i > 0; i -= 2) {
                    kek.push_back(neg[i] * neg[i - 1]);
                }
                sort(all(kek)); reverse(all(kek));
                for (ll i = 0; i < (k-1)/2; i++) {
                    ans = mul(ans, kek[i] % mod);
                }
            }
        } else {
            sort(all(a));
            reverse(all(a));
            for (ll i = 0; i < k; i++) {
                ans *= a[i];
                ans %= mod;
                if (ans < 0)ans += mod;
            }
        }
    }
    cout << ans << endl;
    return 0;
}

/*

*/

Measured memory_bytes: 8168