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

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> llll;
typedef pair<double, double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define FOR(var, from, to) for (int var = (from); var <= (to); ++var)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define rep1(var, n) for (int var = 1; var <= (n); ++var)
#define repC2(vari, varj, n)               \
  for (int vari = 0; vari < (n)-1; ++vari) \
    for (int varj = vari + 1; varj < (n); ++varj)
#define repC3(vari, varj, vark, n)                  \
  for (int vari = 0; vari < (n)-2; ++vari)          \
    for (int varj = vari + 1; varj < (n)-1; ++varj) \
      for (int vark = varj + 1; vark < (n); ++vark)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define tr(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define found(s, e) ((s).find(e) != (s).end())
#define mset(arr, val) memset(arr, val, sizeof(arr))
#define mid(x, y) ((x) + ((y) - (x)) / 2)
#define IN(x, a, b) ((a) <= (x) && (x) <= (b))
#define cons make_pair
#define clamp(v, lo, hi) min(max(v, lo), hi)
#define ABS(x) max((x), -(x))
#define PQ(T) priority_queue<T, vector<T>, greater<T>>

template <typename T1, typename T2>
inline void amin(T1& a, T2 const& b) {
  if (a > b) a = b;
}
template <typename T1, typename T2>
inline void amax(T1& a, T2 const& b) {
  if (a < b) a = b;
}
template <typename X, typename T>
auto vectors(X x, T a) {
  return vector<T>(x, a);
}
template <typename X, typename Y, typename Z, typename... Zs>
auto vectors(X x, Y y, Z z, Zs... zs) {
  auto cont = vectors(y, z, zs...);
  return vector<decltype(cont)>(x, cont);
}

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) {
  while (a) swap(a, b %= a);
  return b;
}
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <typename T>
inline T mod(T a, T b) {
  return ((a % b) + b) % b;
}

template <typename T>
int find_left(vector<T>& v, T elem) {
  return (int)(upper_bound(v.begin(), v.end(), elem) - v.begin()) - 1;
}
template <typename T>
int find_right(vector<T>& v, T elem) {
  return (int)(lower_bound(v.begin(), v.end(), elem) - v.begin());
}

const ll MOD = 1000000007LL;

inline ll ADD(ll x, ll y) { return (x + y) % MOD; }
inline ll SUB(ll x, ll y) { return (x - y + MOD) % MOD; }
inline ll MUL(ll x, ll y) { return x * y % MOD; }
inline ll POW(ll x, ll e) {
  ll v = 1;
  for (; e; x = MUL(x, x), e >>= 1)
    if (e & 1) v = MUL(v, x);
  return v;
}
inline ll INV(ll y) { /*assert(y%MOD!=0);*/
  return POW(y, MOD - 2);
}
inline ll DIV(ll x, ll y) { return MUL(x, INV(y)); }

#define INTSPACE 12
char _buf[INTSPACE * 1000000 + 3];

int loadint() {
  if (fgets(_buf, INTSPACE + 3, stdin) == NULL) return 0;
  return atoi(_buf);
}

int loadvec(vector<int>& v, int N = -1) {
  if (N == 0) {
    v.clear();
    return 0;
  }
  if (N == -1) {
    N = loadint();
    if (N == 0) return 0;
  }
  int bufsize = INTSPACE * N + 3;
  if (fgets(_buf, bufsize, stdin) == NULL) return 0;
  v.resize(N);

  int i = 0;
  bool last = false;
  for (char* p = &_buf[0];;) {
    char* q = p;
    while (*q > ' ') ++q;
    if (*q == 0x0D || *q == 0x0A) last = true;
    *q = 0;
    v[i++] = atoi(p);
    if (last || i == N) break;
    p = q + 1;
  }
  return i;
}
void read_cr() { fgets(_buf, 256, stdin); }

void horizontal(vector<int>& v) {
  int L = v.size();
  for (int i = 0; i < L; ++i) {
    printf("%d%c", v[i], (i == L - 1) ? '\n' : ' ');
  }
}
void horizontall(vector<long long>& v) {
  int L = v.size();
  for (int i = 0; i < L; ++i) {
    printf("%lld%c", v[i], (i == L - 1) ? '\n' : ' ');
  }
}

ll solve(int N, int K, vi& a) {
  vll p, m;
  vector<long double> pd, md;
  p.reserve(N);
  pd.reserve(N);
  m.reserve(N);
  md.reserve(N);
  int zc = 0;
  rep(i, N) {
    if (a[i] == 0) {
      zc++;
      continue;
    }
    if (a[i] < 0) {
      m.pb(-a[i]);
      md.pb(logl(-a[i]));
      continue;
    }
    if (a[i] > 0) {
      p.pb(a[i]);
      pd.pb(logl(a[i]));
      continue;
    }
  }
  sort(ALL(p));
  reverse(ALL(p));
  sort(ALL(pd));
  reverse(ALL(pd));
  int pc = p.size();

  sort(ALL(m));
  reverse(ALL(m));
  sort(ALL(md));
  reverse(ALL(md));
  int mc = m.size();

  vll pac(pc + 1, 1), mac(mc + 1, 1);
  vector<long double> pdac(pc + 1, 0), mdac(mc + 1, 0);
  rep(i, pc) pac[1 + i] = (pac[i] * p[i]) % MOD;
  rep(i, mc) mac[1 + i] = (mac[i] * m[i]) % MOD;
  rep(i, pc) pdac[1 + i] = pdac[i] + pd[i];
  rep(i, mc) mdac[1 + i] = mdac[i] + md[i];

  if (pc + mc < K) return 0;

  long double logmax = -1;
  int logmax_at = -1;

  for (int i = 0; i <= mc; i += 2) {
    if (i > K) break;
    int rem = K - i;
    if (rem > pc) continue;
    assert(i < mdac.size() && K - i < pdac.size());
    long double lg = mdac[i] + pdac[K - i];
    if (lg > logmax) {
      logmax = lg;
      logmax_at = i;
    }
  }
  if (logmax_at >= 0) {
    return MUL(mac[logmax_at], pac[K - logmax_at]);
  }

  if (zc) {
    return 0;
  }

  vll mR(m.rbegin(), m.rend()), pR(p.rbegin(), p.rend());
  vector<long double> mdR(md.rbegin(), md.rend()), pdR(pd.rbegin(), pd.rend());
  vll mRac(mc + 1, 1), pRac(pc + 1, 1);
  vector<long double> mdRac(mc + 1, 0), pdRac(pc + 1, 0);
  rep(i, mc) mRac[1 + i] = (mRac[i] * mR[i]) % MOD;
  rep(i, mc) mdRac[1 + i] = mdRac[i] + mdR[i];
  rep(i, pc) pRac[1 + i] = (pRac[i] * pR[i]) % MOD;
  rep(i, pc) pdRac[1 + i] = pdRac[i] + pdR[i];

  long double logmin = DBL_MAX;
  int logmin_at = -1;
  for (int i = 1; i <= mc; i += 2) {
    if (i > K) break;
    int rem = K - i;
    if (rem > pc) continue;

    long double lg = mdRac[i] + pdRac[K - i];
    assert(i < mdRac.size() && K - i < pdRac.size());
    if (lg < logmin) {
      logmin = lg;
      logmin_at = i;
    }
  }

  if (logmin_at >= 0) {
    return SUB(0, MUL(mRac[logmin_at], pRac[K - logmin_at]));
  }

  return 0;
}

int main() {
  int N, K;
  scanf("%d %d%*c", &N, &K);
  vi a(N);
  loadvec(a, N);
  cout << solve(N, K, a) << endl;
  return 0;
}


Measured memory_bytes: 24980