#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  vector<int> pos, neg;
  int zero = 0;
  for (int i = 0; i < n; ++i) {
    int x;
    scanf("%d", &x);
    if (x > 0) {
      pos.push_back(x);
    } else if (x < 0) {
      neg.push_back(-x);
    } else {
      zero++;
    }
  }
  if (!(pos.size() == 0 && m % 2) &&
      neg.size() / 2 * 2 + pos.size() >= m) {
    sort(pos.begin(), pos.end(), greater<int>());
    sort(neg.begin(), neg.end(), greater<int>());
    int L = min((int)pos.size(), m), R = m - L;
    if (R % 2) {
      ++R;
      --L;
    }
    // trace(L, R);
    while (L >= 2 && R + 2 <= (int)neg.size()) {
      int64 A = 1LL * pos[L - 1] * pos[L - 2];
      int64 B = 1LL * neg[R] * neg[R + 1];
      // trace(A, B);
      if (B <= A) break;
      L -= 2;
      R += 2;
    }
    int64 ret = 1;
    for (int i = 0; i < L; ++i) ret = ret * pos[i] % MOD;
    for (int i = 0; i < R; ++i) ret = ret * neg[i] % MOD;
    printf("%lld\n", ret);
  } else if (zero > 0) {
    puts("0");
  } else {
    sort(pos.begin(), pos.end());
    sort(neg.begin(), neg.end());
    int L = min((int)pos.size(), m), R = m - L;
    while (L >= 1 && R + 1 <= (int)neg.size()) {
      if (pos[L - 1] <= neg[R]) break;
      L -= 1;
      R += 1;
    }
    int64 ret = 1;
    for (int i = 0; i < L; ++i) ret = ret * pos[i] % MOD;
    for (int i = 0; i < R; ++i) ret = ret * neg[i] % MOD;
    ret = (MOD - ret) % MOD;
    printf("%lld\n", ret);
  }
  return 0;
}


Measured memory_bytes: 4004