#include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <time.h>
using namespace std;
const double PI = 3.14159265358979323846;
const long long int MOD = 1000000000 + 7;

struct UnionFind {
    vector<int> parent;

    UnionFind(int N) : parent(N) {
        for (int i = 0; i < N; i++) {
            parent[i] = -1;
        }
    }

    int root(int i) {
        if (parent[i] < 0) {
            return i;
        }
        return (parent[i] = root(parent[i]));
    }

    bool unite(int from, int to) {
        int rx = root(from);
        int ry = root(to);
        if (rx != ry) {
            parent[ry] += parent[rx];
            parent[rx] = ry;

            return true;
        }
        else {
            return false;
        }
    }

    bool same(int x, int y) {
        return root(x) == root(y);
    }

    int treeSize(int x) {


        return -parent[root(x)];
    }
};

long long int modpow(long long int base, long long int pow, long long int mod) {
    if (pow == 1) {
        return base;
    }
    else if (pow == 0) {
        return 1;
    }

    if (pow % 2 == 0) {
        auto temp = modpow(base, pow / 2, mod);
        return (temp * temp) % mod;
    }
    else {
        return (base * modpow(base, pow - 1, mod)) % mod;
    }
}

long long int moddiv(long long int X, long long int Y, long long int mod) {
    auto fermatDiv = modpow(Y, mod - 2, mod);

    return (X * fermatDiv) % mod;
}

long long modCombination(long long left, long long right, long long int mod) {
    long long answer = 1;
    if (left > right) {
        for (long long i = 0; i < right; i++) {
            answer = (answer * (left - i)) % mod;
            answer = moddiv(answer, (i + 1), mod);
        }
    }
    return answer;
}

bool IsPrime(long long N) {
    if (N == 1) {
        return false;
    }
    for (long long i = 2; i * i <= N; i++) {
        if (N % i == 0) {
            return false;
        }
    }


    return true;
}


vector<pair<long long, long long> > prime_factorize(long long N) {
    vector<pair<long long, long long> > res;
    for (long long a = 2; a * a <= N; ++a) {
        if (N % a != 0) continue;
        long long ex = 0; // 指数

        // 割れる限り割り続ける
        while (N % a == 0) {
            ++ex;
            N /= a;
            
        }

        // その結果を push
        res.push_back({ a, ex });
    }

    // 最後に残った数について
    if (N != 1) res.push_back({ N, 1 });
    return res;
}

map<long long, set<long long>> cache;
set<long long> enum_divisors(long long N) {
    set<long long> res;
    for (long long i = 1; i * i <= N; ++i) {
        if (N % i == 0) {
            res.insert(i);

            if (cache.count(N / i) > 0) {
                auto copy = cache[N / i];
                auto copy2 = cache[N / i];
                for (auto v : res) {
                    if (v != 1) {
                        //cout << "v*" << v << endl;
                        for (auto itr = copy2.begin(); itr != copy2.end(); itr++) {
                            copy.insert(*itr * v);
                        }
                        break;
                    }
                }
                cache[N] = copy;
                return copy;
            }

            // 重複しないならば i の相方である N/i も push
            if (N / i != i) res.insert(N / i);

            
        }
    }

    cache[N] = res;
    return res;
}

long long euclid(long long a, long long b) {
    if (a > b) {
        long long temp = b;
        b = a;
        a = temp;
    }
    if (b % a == 0) {
        return a;
    }
    else {
        return euclid(a, b - a);
    }
}

long long gcd(long long a, long long b) {
    if (b > a) {
        long long temp = b;
        b = a;
        a = temp;
    }
    //cout << "a:" << a << "b:" << b << endl;
    long long c = a % b;
    if (c == 0) {
        return b;
    }
    else {
        return gcd(b, c);
    }
}




int main() {
    int N, K;
    cin >> N >> K;

    if (N == K) {
        long long max = 1;
        int negativeCount = 0;
        for (int i = 0; i < N; i++) {
            long long a;
            cin >> a;
            max *= abs(a) % MOD;
            max %= MOD;
            if (a < 0) {
                negativeCount++;
            }
        }
        if (negativeCount % 2 == 0) {
            cout << max << endl;
        }
        else {
            cout << (MOD - max) % MOD << endl;
        }

        return 0;
    }

    vector<long long> positive, negative;
    for (int i = 0; i < N; i++) {
        long long a;
        cin >> a;
        if (a >= 0) {
            positive.push_back(a);
        }
        else {
            negative.push_back(-a);
        }
    }

    sort(positive.begin(), positive.end(), greater<long long>());
    sort(negative.begin(), negative.end(), greater<long long>());

    /*if (K % 2 == 0) {
        


        int positiveCount = K;
        if (K > positive.size()) {
            positiveCount = positive.size() - (positive.size() % 2);
        }

        int negativeCount = K - positiveCount;

        long long max = 0, calc = 1;
        for (int i = 0; i < positiveCount; i++) {
            calc *= positive[i] % MOD;
            calc %= MOD;
        }

        for (int i = 0; i < negativeCount; i++) {
            calc *= negative[i] % MOD;
            calc %= MOD;
        }

        max = calc;

        auto negativeSize = negative.size();
        while (positiveCount != 0 && negativeCount + 2 <= negativeSize) {
            positiveCount--;
            calc = moddiv(calc, positive[positiveCount], MOD);

            positiveCount--;
            calc = moddiv(calc, positive[positiveCount], MOD);

            calc *= negative[negativeCount] % MOD;
            calc %= MOD;
            negativeCount++;

            calc *= negative[negativeCount] % MOD;
            calc %= MOD;
            negativeCount++;

            if (calc > max) {
                max = calc;
            }
        }

        cout << (max + MOD) % MOD << endl;
    }
    else {
        auto negativeSize = negative.size();
        if (positive.size() == 0) {
            long long answer = 1;
            
            for (int i = 0; i < K; i++) {
                answer *= negative[negativeSize - 1 - i] % MOD;
                answer %= MOD;
            }

            cout << (answer + MOD) % MOD << endl;
            return 0;
        }

        int positiveCount = K;
        if (K > positive.size()) {
            positiveCount = positive.size() - (1 - positive.size() % 2);
        }

        int negativeCount = K - positiveCount;

        long long max, calc = 1;
        for (int i = 0; i < positiveCount; i++) {
            calc *= positive[i];
        }

        for (int i = 0; i < negativeCount; i++) {
            calc *= negative[i];
        }

        max = calc;

        while (positiveCount != 1 && negativeCount + 2 <= negativeSize) {
            positiveCount--;
            calc /= positive[positiveCount];

            positiveCount--;
            calc /= positive[positiveCount];

            calc *= negative[negativeCount];
            negativeCount++;

            calc *= negative[negativeCount];
            negativeCount++;

            if (calc > max) {
                max = calc;
            }
        }

        cout << max << endl;
    }*/


    long long answer = 1;

    if (K % 2 == 0) {
        if (positive.size() < 2) {
            long long answer = 1;
            for (int i = 0; i < K; i++) {
                answer *= negative[i];
                answer %= MOD;
            }

            cout << answer % MOD << endl;

            return 0;
        }

        int positiveSelect = 0, negativeSelect = 0;

        long long answer = 1;

        int positiveSize = positive.size(), negativeSize = negative.size();

        while (positiveSelect + negativeSelect < K) {
            long long positiveMul = -1;
            if (positiveSelect + 2 <= positiveSize) {
                positiveMul = positive[positiveSelect] * positive[positiveSelect + 1];
            }

            long long negativeMul = -1;
            if (negativeSelect + 2 <= negativeSize) {
                negativeMul = negative[negativeSelect] * negative[negativeSelect + 1];
            }

            if (positiveMul > negativeMul) {
                answer *= positiveMul % MOD;
                answer %= MOD;

                positiveSelect += 2;
            }
            else {
                answer *= negativeMul % MOD;
                answer %= MOD;

                negativeSelect += 2;
            }
        }

        cout << answer << endl;
    }
    else {
        int negativeSize = negative.size();
        if (positive.size() < 1) {
            long long answer = 1;
            for (int i = 0; i < K; i++) {
                answer *= negative[negativeSize - 1 -i];
                answer %= MOD;
            }

            cout << (MOD - answer) % MOD << endl;

            return 0;
        }

        int positiveSelect = 1, negativeSelect = 0;

        long long answer = positive[0];

        int positiveSize = positive.size();

        while (positiveSelect + negativeSelect < K) {
            long long positiveMul = -1;
            if (positiveSelect + 2 <= positiveSize) {
                positiveMul = positive[positiveSelect] * positive[positiveSelect + 1];
            }

            long long negativeMul = -1;
            if (negativeSelect + 2 <= negativeSize) {
                negativeMul = negative[negativeSelect] * negative[negativeSelect + 1];
            }

            if (positiveMul > negativeMul) {
                answer *= positiveMul % MOD;
                answer %= MOD;

                positiveSelect += 2;
            }
            else {
                answer *= negativeMul % MOD;
                answer %= MOD;

                negativeSelect += 2;
            }
        }

        cout << answer << endl;
    }
    return 0;
}

Measured memory_bytes: 5464