#include <bits/stdc++.h>
using namespace std;

// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;

/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()

/* REPmacro */
#define REPS(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (ll i = (a); i >= (ll)(n); --i)
#define DEP(i, n) DEPS(i, n, 0)
#define EACH(i, n) for (auto&& i : n)

/* debug */
#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n';

/* alias */
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using plglg = pair<ll, ll>;
using tlglglg = tuple<ll, ll, ll>;
using D = double;
using P = complex<D>;
using vs = vector<string>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;

/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int mod = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};

/* func */
inline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}
inline int in() {int x; cin >> x; return x;}
inline ll IN() {ll x; cin >> x; return x;}
inline vs split(const string& t, char c) {vs v; stringstream s(t); string b; while(getline(s, b, c)) v.eb(b); return v;}
template <typename T> inline bool chmin(T& a, const T& b) {if (a > b) a = b; return a > b;}
template <typename T> inline bool chmax(T& a, const T& b) {if (a < b) a = b; return a < b;}
template <typename T, typename S> inline void print(const pair<T, S>& p) {cout << p.first << " " << p.second << endl;}
template <typename T> inline void print(const T& x) {cout << x << endl;}
template <typename T, typename S> inline void print(const vector<pair<T, S>>& v) {for (auto&& p : v) print(p);}
template <typename T> inline void print(const vector<T>& v, string s = " ") {REP(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");}
inline void yesno(bool ok, string yes = "Yes", string no = "No") {cout << (ok?yes:no) << endl;}


// void test(volatile int a, volatile int b) {
//     volatile int res = a % b;
//     std::cout << a << " % " << b << " = " << res << std::endl;
// }

ll modminus(ll x, ll y) {
    return (x - y + mod) % mod;
}

ll multiply(ll x, ll y) {
    return (x % mod) * (y % mod) % mod;
}

ll power(ll x, ll y) {
    if (y == 0) {
        return 1;
    } else if (y == 1) {
        return x % mod;
    } else if (y % 2 == 0) {
        ll p = power(x, y / 2);
        return p * p % mod;
    } else {
        ll p = power (x, y / 2);
        return (p * p) % mod * (x % mod) % mod;
    }
}

ll divide(ll x, ll y) {
    return multiply(x, power(y, mod - 2));
}

signed main() {
    //my-code
    // test(5, 3);
    // test(5, -3);
    // test(-5, 3);
    // test(-5, -3);
    ll n, k; cin >> n >> k;

    ll cntz = 0;
    ll cntp = 0;
    ll cntm = 0;

    vll a(n);
    vll p;
    vll m;
    REP(i, n) {
        cin >> a[i];
        if (a[i] > 0) {
            cntp++;
            p.push_back(a[i]);
        } else if (a[i] < 0){
            cntm++;
            m.push_back(-a[i]);
        } else {
            cntz++;
        }
    }

    if (k > (cntp+cntm)) {
        cout << 0 << endl;
        return 0;
    }

    sort(ALL(p), greater<ll>());
    sort(ALL(m), greater<ll>());

    if (k % 2 == 0) {
        if (cntp/2 + cntm/2 < k/2) {
            if (cntz > 0) {
                cout << 0 << endl;
            } else {
                ll ans = 1;
                for(ll x : p) {
                    ans = multiply(ans, x);
                }
                for(ll x : m) {
                    ans = multiply(ans, x);
                }
                ans = (mod - ans) % mod;
                cout << ans << endl;
            }
        } else {
            ll ans = 1;
            ll cnt = 0;
            ll l, r;
            ll i=0, j=0;
            // print("DBG");
            // print(p);print(m);
            while(cnt < k) {
                if (i+1 < p.size()) {
                    l = p[i] * p[i+1];
                } else {
                    l = 0;
                }
                if (j+1 < m.size()) {
                    r = m[j] * m[j+1];
                } else {
                    r = 0;
                }
                if (l > r) {
                    ans = multiply(ans, (l % mod));
                    i++;i++;
                } else {
                    ans = multiply(ans, (r % mod));
                    j++;j++;
                }
                cnt++;
                cnt++;
            }
            cout << ans << endl;
        }
    } else {  // k % 2 == 1
        // sometimes 0 is best
        if (max(0LL,((cntp-1)/2)*2+1) + (cntm/2)*2 < k) {
            if (cntz > 0) {
                cout << 0 << endl;
            } else {
                ll ans = 1;
                for(ll x : p) {
                    ans = multiply(ans, x);
                }
                for(ll x : m) {
                    ans = multiply(ans, x);
                }
                ans = (mod - ans) % mod;
                cout << ans << endl;
            }
        } else if (cntp == 0) {
            if (cntz > 0) {
                cout << 0 << endl;
            } else {
                sort(ALL(m));
                ll ans = 1;
                REP(i, k) {
                    ans = multiply(ans, m[i]);
                }
                ans = (mod - ans) % mod;
                cout << ans << endl;
            }
        } else {
            ll ans = p[0];
            ll cnt = 1;
            ll l, r;
            ll i=1, j=0;
            // print("DBG");
            // print(p);print(m);
            while(cnt < k) {
                if (i+1 < p.size()) {
                    l = p[i] * p[i+1];
                } else {
                    l = 0;
                }
                if (j+1 < m.size()) {
                    r = m[j] * m[j+1];
                } else {
                    r = 0;
                }
                if (l > r) {
                    ans = multiply(ans, (l % mod));
                    i++;i++;
                } else {
                    ans = multiply(ans, (r % mod));
                    j++;j++;
                }
                cnt++;
                cnt++;
            }
            cout << ans << endl;
        }
    }


    return 0;
}

// https://github.com/kurokoji/.cpp-Template/wiki テンプレートについて
// http://www.creativ.xyz/dump-cpp-652 dump()について
// https://gist.github.com/rigibun/7905920 色々

Measured memory_bytes: 6884