#include<iostream>
#include<cstdio>
#include<stack>
#include<queue>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<math.h>
#include<tuple>
#include<string.h>
#include <numeric> 
#include<unordered_map>
using namespace std; 
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define pp(...) "\033[94m [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "]\033[0m"
#define pp1(...) "\033[1;47;35m" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "]\033[0m"
#define dg(x) debug() << pp1(x)
#define dg1(x) debug() << pp(x)
#define dg2(x,y) debug() << pp(x) pp(y)
#define dg3(x,y,z) debug() << pp(x) pp(y) pp(z)
#define dg4(w,x,y,z) debug() << pp(w) pp(x) pp(y) pp(z)
#define int long long
#define all(x) x.begin() , x.end()
#define clr(x) memset(x , 0 , sizeof x);
#define sz(x) (int)x.size()
template<typename T> void db(T x ){ debug() <<">>> " <<  x; }
template<typename T> void db(T x , T y){ debug() <<">>> " <<  x <<" , "<< y; }
template<typename T> void db(T x , T y , T z){ debug() <<">>> "<< x <<" , "<< y <<" , "<< z; }
template<typename T> void db(T x , T y , T z , T a){ debug() <<">>> "<< x <<" , " << y <<" , "<< z <<" , "<< a; }
const int xx = 2e5;
const int Mod = 1e9 + 7;
const int inf = 1e18;
const int Maxn = 20010;

signed main(){
  ios::sync_with_stdio(false);cin.tie(0);
  int N, K;
  cin >> N >> K;
  vector<int> a(N);
  int ng = 0;
  for(int i = 0; i < N; i++) {
    cin >> a[i];
    if(a[i] < 0) ng++;
  }
  dg1(a);
  dg1(ng);
  int sign = 1;
  for(int i = 2; i <= ng && i <= K; i += 2) {
    if(i + (N - ng) >= K) sign = -1;
  }
  if(N - ng >= K) sign = -1;
  dg1(sign);
  priority_queue<int> Pos , Neg;
  for(int i = 0; i < N; i++) {
    if(a[i] >= 0) Pos.push(a[i]);
    else Neg.push(sign * a[i]);
  }
  vector<int> p , n;
  db("OK");

  while(K--) {
    if(sz(Pos) && sz(Neg)) {
      int x = Pos.top() , y = Neg.top();
      if(x >= y) {
        p.push_back(x);
        Pos.pop();
      } else{
        n.push_back(y);
        Neg.pop();
      }
    }
    else if(sz(Pos)) {
      p.push_back(Pos.top());
      Pos.pop();
    }
    else if(sz(Neg)) {
      n.push_back(Neg.top());
      Neg.pop();
    }

  }

  dg1(p);dg1(n);
  if(sz(n) % 2) {
    if(sz(Neg) && sz(p) && sz(Pos)) {
      int x = n.back() * (Neg.top());
      int y = p.back() * (Pos.top());
      if(x > y) {
        p.pop_back();
        n.push_back(Neg.top());
      } else{
        n.pop_back();
        p.push_back(Pos.top());
      }
    }
    else if(sz(Pos)) {
      n.pop_back();
      p.push_back(Pos.top());
    }
    else if(sz(Pos) == 0 && sz(Neg) && sz(p)) {
      p.pop_back();
      n.push_back(Neg.top());
    }
  }
  dg1(p);dg1(n);
  int ans = 1;
  for(int i : p) {
    ans = (ans * i) % Mod;
    ans = (ans + Mod) % Mod;
  }
  for(int i : n) {
    ans = (ans * abs(i)) % Mod;
    ans = (ans + Mod) % Mod;
  }
  if(sign == 1) {
    ans = ans * -1;
  }
  dg1(ans);
  ans = (ans % Mod + Mod) % Mod;
  cout << ans << '\n';
 
}

Measured memory_bytes: 9128