//#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
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;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//-std=gnu++17
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, k;
    cin >> n >> k;
    vector<ll> c, d, a(n);
    rep(i, n) cin >> a[i];
    rep(i, n)
    {
        if (a[i] >= 0)
        {
            c.push_back(a[i]);
        }
        else
        {
            d.push_back(-a[i]);
        }
    }
    if (n == k)
    {
        ll ans = 1;
        rep(i, n)
        {
            ans *= a[i];
            ans %= MOD;
            ans += MOD;
            ans %= MOD;
        }
        cout << ans << "\n";
        return 0;
    }
    if (n == 1)
    {
        return cout << a[0] << "\n", 0;
    }
    sort(ALL(c), greater<ll>());
    sort(ALL(d), greater<ll>());
    if (k == 1 && c.size())
    {
        cout << c[0] << "\n";
        return 0;
    }
    else if (k == 1 && d.size())
    {
        ll temp=-d[d.size()-1];
        temp+=MOD;
        temp%=MOD;
        cout<<temp<<"\n";
        return 0;
    }
    if (c.size() == 0)
    {
        ll ans = 1;
        if(k%2){
        rep(i, k)
        {
            ans *= -d[d.size() - 1 - i];
            ans %= MOD;
        }
        }
        else{
            rep(i,k){
                ans *= d[i];
                ans %= MOD;
            }
        }
        ans += MOD;
        ans %= MOD;
        cout << ans << "\n";
        return 0;
    }
    if (d.size() == 0)
    {
        ll ans = 1;
        rep(i, k)
        {
            ans *= c[i];
            ans %= MOD;
        }
        ans %= MOD;
        cout << ans << "\n";
        return 0;
    }
    ll c_ind = k;
    ll d_ind = 0;
    while (c_ind > c.size())
    {
        c_ind -= 2;
        d_ind += 2;
    }
    while (true)
    {
        if (d_ind + 1 >= d.size() || c_ind - 2 < 0)
            break;
        ll temp_c = c[c_ind - 1] * c[c_ind - 2];
        ll temp_d = d[d_ind + 1] * d[d_ind];
        if (temp_c > temp_d)
        {
            break;
        }
        c_ind -= 2;
        d_ind += 2;
    }
    ll ans = 1;
    rep(i, c_ind)
    {
        ans *= c[i];
        ans %= MOD;
    }
    rep(j, d_ind)
    {
        ans *= d[j];
        ans %= MOD;
    }
    cout << ans << "\n";
}


Measured memory_bytes: 6848