#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define MD (1000000007U)
void *wmem;
char memarr[96000000];
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
  static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
  (*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );
  (*arr)=(T*)(*mem);
  (*mem)=((*arr)+x);
}
template<class T1> void sortA_L(int N, T1 a[], void *mem = wmem){
  sort(a, a+N);
}
struct Modint{
  unsigned val;
  Modint(){
    val=0;
  }
  Modint(int a){
    val = ord(a);
  }
  Modint(unsigned a){
    val = ord(a);
  }
  Modint(long long a){
    val = ord(a);
  }
  Modint(unsigned long long a){
    val = ord(a);
  }
  inline unsigned ord(unsigned a){
    return a%MD;
  }
  inline unsigned ord(int a){
    a %= (int)MD;
    if(a < 0){
      a += MD;
    }
    return a;
  }
  inline unsigned ord(unsigned long long a){
    return a%MD;
  }
  inline unsigned ord(long long a){
    a %= (int)MD;
    if(a < 0){
      a += MD;
    }
    return a;
  }
  inline unsigned get(){
    return val;
  }
  inline Modint &operator+=(Modint a){
    val += a.val;
    if(val >= MD){
      val -= MD;
    }
    return *this;
  }
  inline Modint &operator-=(Modint a){
    if(val < a.val){
      val = val + MD - a.val;
    }
    else{
      val -= a.val;
    }
    return *this;
  }
  inline Modint &operator*=(Modint a){
    val = ((unsigned long long)val*a.val)%MD;
    return *this;
  }
  inline Modint &operator/=(Modint a){
    return *this *= a.inverse();
  }
  inline Modint operator+(Modint a){
    return Modint(*this)+=a;
  }
  inline Modint operator-(Modint a){
    return Modint(*this)-=a;
  }
  inline Modint operator*(Modint a){
    return Modint(*this)*=a;
  }
  inline Modint operator/(Modint a){
    return Modint(*this)/=a;
  }
  inline Modint operator+(int a){
    return Modint(*this)+=Modint(a);
  }
  inline Modint operator-(int a){
    return Modint(*this)-=Modint(a);
  }
  inline Modint operator*(int a){
    return Modint(*this)*=Modint(a);
  }
  inline Modint operator/(int a){
    return Modint(*this)/=Modint(a);
  }
  inline Modint operator+(long long a){
    return Modint(*this)+=Modint(a);
  }
  inline Modint operator-(long long a){
    return Modint(*this)-=Modint(a);
  }
  inline Modint operator*(long long a){
    return Modint(*this)*=Modint(a);
  }
  inline Modint operator/(long long a){
    return Modint(*this)/=Modint(a);
  }
  inline Modint operator-(void){
    Modint res;
    if(val){
      res.val=MD-val;
    }
    else{
      res.val=0;
    }
    return res;
  }
  inline operator bool(void){
    return val!=0;
  }
  inline operator int(void){
    return get();
  }
  inline operator long long(void){
    return get();
  }
  inline Modint inverse(){
    int a = val;
    int b = MD;
    int u = 1;
    int v = 0;
    int t;
    Modint res;
    while(b){
      t = a / b;
      a -= t * b;
      swap(a, b);
      u -= t * v;
      swap(u, v);
    }
    if(u < 0){
      u += MD;
    }
    res.val = u;
    return res;
  }
  inline Modint pw(unsigned long long b){
    Modint a(*this);
    Modint res;
    res.val = 1;
    while(b){
      if(b&1){
        res *= a;
      }
      b >>= 1;
      a *= a;
    }
    return res;
  }
  inline bool operator==(int a){
    return ord(a)==val;
  }
  inline bool operator!=(int a){
    return ord(a)!=val;
  }
}
;
inline Modint operator+(int a, Modint b){
  return Modint(a)+=b;
}
inline Modint operator-(int a, Modint b){
  return Modint(a)-=b;
}
inline Modint operator*(int a, Modint b){
  return Modint(a)*=b;
}
inline Modint operator/(int a, Modint b){
  return Modint(a)/=b;
}
inline Modint operator+(long long a, Modint b){
  return Modint(a)+=b;
}
inline Modint operator-(long long a, Modint b){
  return Modint(a)-=b;
}
inline Modint operator*(long long a, Modint b){
  return Modint(a)*=b;
}
inline Modint operator/(long long a, Modint b){
  return Modint(a)/=b;
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
inline void wt_L(Modint x){
  int i;
  i = (int)x;
  wt_L(i);
}
int N;
int K;
int A[200000];
int zs;
int ps;
long long p[200000];
int ms;
long long m[200000];
int main(){
  int i;
  wmem = memarr;
  Modint res = 1;
  rd(N);
  rd(K);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);
    }
  }
  if(K==N){
    int i;
    for(i=(0);i<(N);i++){
      res *= A[i];
    }
    wt_L(res);
    wt_L('\n');
    return 0;
  }
  for(i=(0);i<(N);i++){
    if(A[i]==0){
      zs++;
      continue;
    }
    if(A[i]>0){
      p[ps++] = A[i];
    }
    if(A[i]<0){
      m[ms++] = -A[i];
    }
  }
  sortA_L(ps, p);
  sortA_L(ms, m);
  if(ps+ms < K){
    wt_L(0);
    wt_L('\n');
    return 0;
  }
  if(ps==0 && K%2==1){
    if(zs){
      wt_L(0);
      wt_L('\n');
      return 0;
    }
    for(i=(0);i<(K);i++){
      res *= -m[i];
    }
    wt_L(res);
    wt_L('\n');
    return 0;
  }
  for(i=(0);i<(zs);i++){
    p[ps++] = 0;
  }
  sortA_L(ps, p);
  if(K%2==1){
    K--;
    res *= p[--ps];
  }
  while(K){
    K -= 2;
    if(ps >= 2 && ms >= 2 && p[ps-1] * p[ps-2] > m[ms-1] * m[ms-2]){
      res *= p[--ps];
      res *= p[--ps];
      continue;
    }
    if(ps >= 2 && ms >= 2 && p[ps-1] * p[ps-2] < m[ms-1] * m[ms-2]){
      res *= m[--ms];
      res *= m[--ms];
      continue;
    }
    if(ps >= 2){
      res *= p[--ps];
      res *= p[--ps];
      continue;
    }
    if(ms >= 2){
      res *= m[--ms];
      res *= m[--ms];
      continue;
    }
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20200509-1

// --- original code ---
// int N, K, A[2d5];
// int zs;
// int ps; ll p[2d5];
// int ms; ll m[2d5];
// {
//   Modint res = 1;
//   rd(N,K,A(N));
//   if(K==N){
//     rep(i,N) res *= A[i];
//     wt(res), return 0;
//   }
// 
//   rep(i,N){
//     if(A[i]==0) zs++, continue;
//     if(A[i]>0) p[ps++] = A[i];
//     if(A[i]<0) m[ms++] = -A[i];
//   }
//   sortA(ps, p);
//   sortA(ms, m);
// 
//   if(ps+ms < K) wt(0), return 0;
//   if(ps==0 && K%2==1){
//     if(zs) wt(0), return 0;
//     rep(i,K) res *= -m[i];
//     wt(res), return 0;
//   }
// 
//   rep(i,zs) p[ps++] = 0;
//   sortA(ps, p);
//   if(K%2==1) K--, res *= p[--ps];
//   while(K){
//     K -= 2;
//     if(ps >= 2 && ms >= 2 && p[ps-1] * p[ps-2] > m[ms-1] * m[ms-2]){
//       res *= p[--ps];
//       res *= p[--ps];
//       continue;
//     }
//     if(ps >= 2 && ms >= 2 && p[ps-1] * p[ps-2] < m[ms-1] * m[ms-2]){
//       res *= m[--ms];
//       res *= m[--ms];
//       continue;
//     }
//     if(ps >= 2){
//       res *= p[--ps];
//       res *= p[--ps];
//       continue;
//     }
//     if(ms >= 2){
//       res *= m[--ms];
//       res *= m[--ms];
//       continue;
//     }
//   }
//   wt(res);
// }


Measured memory_bytes: 6948