#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
#define flagcount __builtin_popcount
#define flag(x) (1 << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1 << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x)))  //配列vでx未満の要素数を返す
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x))) //配列vでx以下の要素数を返す
#define idx_lower2(v, x) (v.size() - idx_lower(v, x))         //配列vでx以上の要素数を返す
#define idx_upper2(v, x) (v.size() - idx_upper(v, x))         //配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Gput(a, b) G[a].push_back(b)
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
    if (c >= '0' && c <= '9')
    {
        return c - '0';
    }
    return 0;
}
template <typename T>
T lcm(T x, T y)
{
    T z = gcd(x, y);
    return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
    if (n < 2)
        return false;
    else if (n == 2)
        return true;
    else if (n % 2 == 0)
        return false;
    double sqrtn = sqrt(n);
    for (T i = 3; i < sqrtn + 1; i++)
    {
        if (n % i == 0)
        {
            return false;
        }
        i++;
    }
    return true;
}
//場合によって使い分ける
//const ll dx[4]={1,0,-1,0};
//const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//2次元配列の宣言
//vector<vector<ll>> field(h, vector<ll>(w));

int main()
{
    cout << fixed << setprecision(30);
    ll N, K;
    cin >> N >> K;
    vec a(N);
    ll minus = 0;
    loop(i, N)
    {
        cin >> a[i];
        if (a[i] < 0)
            minus++;
    }
    ll ans = 1;
    //全部とる
    if (N == K)
    {
        loop(i, N)
        {
            if (a[i] < 0)
            {
                ans = (ans * (mod + a[i])) % mod;
            }
            else
            {
                ans = (ans * a[i]) % mod;
            }
        }
        putout(ans);
        return 0;
    }
    //必ず負数に
    if (minus == N && K % 2 == 1)
    {
        sort(all(a));
        reverse(all(a));
        loop(i, K)
        {
            ans = (ans * (mod + a[i])) % mod;
        }
        putout(ans);
        return 0;
    }
    vector<pair<ll, ll>> pairs(N);
    loop(i, N) pairs[i] = make_pair(abs(a[i]), a[i]);
    sort(all(pairs));
    reverse(all(pairs));
    //絶対値が大きい順にまずK個選ぶ
    //このK個のうちのマイナスの個数が偶数ならそれが答え
    //それ以外の場合、最大2種類の方法で解を正の最大値にできる
    //ここで、minus:全体の中の負数, Kminus:K個選んだ中の負数 とする
    //(N-K)-(minus-Kminus)>0のとき
    //(1)選んだK個のうち、絶対値が最も小さい負数を捨てて、K個以外で絶対値が最も大きい非負数を選ぶ
    //K-Kminus>0&&minus-Kminus>0のとき
    //(2)選んだK個のうち、絶対値が最も小さい非負数を捨てて、K個以外で絶対値が最も大きい負数を選ぶ
    vector<ll> select(K), unselect(N - K);
    ll Kminus = 0;
    loop(i, K)
    {
        select[i] = pairs[i].second;
        if (select[i] < 0)
            Kminus++;
    }
    loop(i, N - K) unselect[i] = pairs[K + i].second;
    if (Kminus % 2 == 0)
    {
        loop(i, K)
        {
            ans *= abs(select[i]);
            ans %= mod;
        }
        putout(ans);
        return 0;
    }
    bool b1 = false, b2 = false;
    vector<ll> select1 = select;
    ll preans = 1;
    ll bef = 0, aft = 0;
    if ((N - K) - (minus - Kminus) > 0)
    {
        b1 = true;
        ll ind = 0;
        for (ll i = K - 1; i >= 0; i--)
        {
            if (select1[i] < 0)
            {
                ind = i;
                bef = select1[i];
                break;
            }
        }
        for (ll i = 0; i < N - K; i++)
        {
            if (unselect[i] >= 0)
            {
                select1[ind] = unselect[i];
                aft = unselect[i];
                break;
            }
        }
    }
    vector<ll> select2 = select;
    ll preans2 = 1;
    ll bef2 = 0, aft2 = 0;
    if (K - Kminus > 0 && minus - Kminus > 0)
    {
        b2 = true;
        ll ind = 0;
        for (ll i = K - 1; i >= 0; i--)
        {
            if (select2[i] >= 0)
            {
                ind = i;
                bef2 = select2[i];
                break;
            }
        }
        for (ll i = 0; i < N - K; i++)
        {
            if (unselect[i] < 0)
            {
                select2[ind] = unselect[i];
                aft2 = unselect[i];
                break;
            }
        }
    }
    if (b1 == false)
    {
        loop(i, K)
        {
            preans2 *= abs(select2[i]);
            preans2 %= mod;
        }
        putout(preans2);
        return 0;
    }
    if (b2 == false)
    {
        loop(i, K)
        {
            preans *= abs(select1[i]);
            preans %= mod;
        }
        putout(preans);
        return 0;
    }
    //select1を選ぶ
    if (abs(bef2 * aft) >= abs(bef * aft2))
    {
        loop(i, K)
        {
            preans *= abs(select1[i]);
            preans %= mod;
        }
        putout(preans);
        return 0;
    }
    else
    {
        loop(i, K)
        {
            preans2 *= abs(select2[i]);
            preans2 %= mod;
        }
        putout(preans2);
        return 0;
    }
    return 0;
}


Measured memory_bytes: 12748