#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
void debug() { cerr << "\n"; }
template <class T> void debug(const T &x) { cerr << x << "\n"; }
template <class T, class... Args> void debug(const T &x, const Args &... args) {
    cerr << x << " ";
    debug(args...);
}
template <class T> void debugVector(const vector<T> &v) {
    for(const T &x : v) {
        cerr << x << " ";
    }
    cerr << "\n";
}
using ll = long long;

#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const double PI = acos(-1);
constexpr int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

//-------------------------------------

template <int mod> struct ModInt {
    int x;

    ModInt() : x(0) {}

    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= mod)
            x -= mod;
        return *this;
    }

    ModInt &operator-=(const ModInt &p) {
        if((x += mod - p.x) >= mod)
            x -= mod;
        return *this;
    }

    ModInt &operator*=(const ModInt &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }

    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }

    ModInt operator-() const { return ModInt(-x); }

    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

    bool operator==(const ModInt &p) const { return x == p.x; }

    bool operator!=(const ModInt &p) const { return x != p.x; }

    ModInt inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }

    ModInt pow(int64_t n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1)
                ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const ModInt &p) {
        return os << p.x;
    }

    friend istream &operator>>(istream &is, ModInt &a) {
        int64_t t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }

    static int get_mod() { return mod; }
};

using mint = ModInt<MOD>;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, K;
    cin >> N >> K;
    vector<ll> a(N);
    for(auto &it : a) {
        cin >> it;
    }
    sort(ALL(a), [](const ll &x, const ll &y) { return llabs(x) > llabs(y); });
    int mcnt = 0;
    mint ans = 1;
    for(int i = 0; i < K; i++) {
        if(a[i] < 0) {
            mcnt++;
        }
        ans *= mint(a[i]);
    }
    if(mcnt % 2 == 0) {
        cout << ans << endl;
        return 0;
    }
    // 負の数を1個とって、正の数を1個入れる
    ll M1 = LLINF, P1 = LLINF;
    for(int i = 0; i < K; i++) {
        if(a[i] < 0) {
            M1 = a[i];
        }
    }
    for(int i = K; i < N; i++) {
        if(a[i] >= 0) {
            P1 = a[i];
            break;
        }
    }
    // 正の数を1個とって、負の数を1個入れる
    ll M2 = LLINF, P2 = LLINF;
    for(int i = 0; i < K; i++) {
        if(a[i] > 0) {
            P2 = a[i];
        }
    }
    for(int i = K; i < N; i++) {
        if(a[i] <= 0) {
            M2 = a[i];
            break;
        }
    }
    bool ok1 = (M1 != LLINF && P1 != LLINF);
    bool ok2 = (M2 != LLINF && P2 != LLINF);
    if(ok1 && ok2) {
        if(P1 * P2 > M1 * M2) {
            ans = (ans * mint(P1)) / mint(M1);
        } else {
            ans = (ans * mint(M2)) / mint(P2);
        }
    } else if(ok1) {
        ans = (ans * mint(P1)) / mint(M1);
    } else if(ok2) {
        ans = (ans * mint(M2)) / mint(P2);
    } else {
        sort(ALL(a),
             [](const ll &x, const ll &y) { return llabs(x) < llabs(y); });
        ans = 1;
        for(int i = 0; i < K; i++) {
            ans *= mint(a[i]);
        }
    }
    cout << ans << endl;
}

Measured memory_bytes: 4788