#include <bits/stdc++.h>
#include <stdio.h>

using namespace std;
#define inputInt(a) int a; cin >> a; 
#define inputInt2(a,b) int a; int b; cin >> a >> b; 
#define inputInt3(a,b,c) int a; int b; int c; cin >> a >> b >> c;
#define inputLong(a) long a;cin >> a; 
#define inputIntArray(a,N) int a[N];for(int i=0;i<N;i++){cin >> a[i];}
#define inputLongArray(a,N) long a[N];for(int i=0;i<N;i++){cin >> a[i];}
#define inputIntArray2(a,b,N) int a[N]; int b[N]; for(int i=0;i<N;i++){cin >> a[i] >> b[i];}
#define output(answer) cout << answer << endl;
#define fN(i,N)    for(int i=0; i<N; i++)
#define fSE(i,s,e) for(int i=s; i<=e; i++)
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i,N) for(int i=0; i<N; i++)
#define cinv(v,N) vector<int> v(N); for(int i=0; i<N; i++){ cin >> v[i]; }
#define mt make_tuple
#define vll vector<long long int>
#define vvll vector<vector<long long int>>
#define all(v) (v).begin(),(v).end()
#define show(v) FOR(i,v.size()){ cout << v[i] << " "; } cout << endl;
#define showshow(v) FOR(i,v.size()){ FOR(j,v[i].size()){ cout << v[i][j] << " "; } cout << endl; }
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

//Combination計算
const int LIMIT = 1e6;//1e6→50ms,1e7→500ms,1e8→5000ms程度。
//const ll MOD = 1e9+7;
vector<ll> FacMod(LIMIT), InvMod(LIMIT), FacInvMod(LIMIT);
const int dpComTableLIMIT = 3e3+1;
vector<vector<ll>> Com(dpComTableLIMIT,vector<ll>(dpComTableLIMIT,0));
const int ComKTableLIMIT = 1e7;
vector<ll> ComK(ComKTableLIMIT);

void DPComInit(){
  //Com[0][j]は0で初期化されている。
  for(int i=0; i<dpComTableLIMIT; i++){ Com[i][0] = 1; }
  
  for(int i=1; i<dpComTableLIMIT; i++){
    for(int j=1; j<dpComTableLIMIT; j++){
      Com[i][j] = (Com[i-1][j-1]+Com[i-1][j])%MOD;
    }
  }
}

void ComKInit(ll N){
  for(int i=0; i<=ComKTableLIMIT; i++){
    if(0<i && i<=N/2){
      ComK[i] = (ComK[i-1]*(N-i+1)/i)%MOD;
    }else if(i==0){
      ComK[i] = 1;
    }else if(N/2<i && i<=N){
      ComK[i] = ComK[N-i];
    }else{//i>Nの時
      ComK[i] = -1;
    }
  }
}

void ComInit(){//tableを作成
  FacMod[0] = FacMod[1] = 1;
  InvMod[0] = 0; InvMod[1] = 1; //InvMod[0]は定義できない
  FacInvMod[0] = FacInvMod[1] = 1;
  
  for(int i=2; i<LIMIT; i++){
    FacMod[i] = FacMod[i-1]*i%MOD;
    InvMod[i] = -InvMod[MOD%i]*(MOD/i)%MOD + MOD;
    FacInvMod[i] = FacInvMod[i-1] * InvMod[i]%MOD;
  }
}

ll ComMod(int n, int k){
  if(n>=0 && k>=0 && n>=k){
    return FacMod[n]*(FacInvMod[k]*FacInvMod[n-k]%MOD)%MOD;
  }else{
    return 0; //戻り値を0にする方が計算結果に影響が少ない。
  }
}


//繰り返し2乗法
ll power(ll x, ll y){//繰り返し2乗法
  if(y < 0){
    return 0;
  }else if(y == 0){
    return 1LL;
  }else if(y%2 == 0){//偶数
    return power(x,y/2)*power(x,y/2);
  }else{//奇数
    return power(x,y-1)*x;
  }
}

//繰り返し2乗法
ll mpower(ll x, ll y, ll m){//繰り返し2乗法
  if(y < 0){
    return 0;
  }else if(y == 0){
    return 1LL;
  }else if(y%2 == 0){//偶数
    return mpower(x,y/2,m)*mpower(x,y/2,m)%m;
  }else{//奇数
    return mpower(x,y-1,m)*x%m;
  }
}

//pair型のソート
bool compare_by_second(pair<ll,ll> a, pair<ll,ll> b){
  return a.second != b.second ? a.second < b.second : a.first < b.first;
}

class UnionFind {
  vector<int> parent;
  vector<int> rank;
  
  public:
  
  UnionFind(int N);
  int root(int x);
  void unite(int x, int y);
  bool isUnited(int x, int y);
  int getRank(int x);
};

UnionFind::UnionFind(int N):parent(N),rank(N,1){
  for(int i=0; i<N; i++){parent[i]=i;}
}
  
int UnionFind::root(int x){
  if(parent[x] == x) return x;
  return root(parent[x]);
  /*parent[x] = parent[parent[x]];
  if(parent[x]!=parent[parent[x]]) rank[x]-=1;*/
}
  
void UnionFind::unite(int x, int y) { // xとyの木を併合
  int rx = root(x); //xの根をrx
  int ry = root(y); //yの根をry
  if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
  
  if(rank[x] >= rank[y]){parent[ry] = rx; rank[y]+=1;}//大きい木に小さい木が併合される
  else{parent[rx] = ry; rank[x]+=1;}//根に直接辺を張る
}
  
bool UnionFind::isUnited(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
  int rx = root(x);
  int ry = root(y);
  parent[x]=rx; parent[y]=ry;rank[x]=2;rank[y]=2;
  return rx == ry;
}

int UnionFind::getRank(int x){
  return rank[x];
}

int main()
{
  //input
  cin.tie(0);
  ios::sync_with_stdio(false);
  
  ll N; ll K; cin >> N >> K;
  bool isAllNegative = 1, hasZero = 0; 
  ll numP = 0; ll numN = 0; ll numZero = 0;
  vll a(N); 
  FOR(i,N){ 
    cin >> a[i]; 
    if(a[i]<0){ //負
      numN ++;
    }else if(a[i] == 0){
      //isAllNegative = 0;
      hasZero = 1;
      numZero ++;
    }else{//正
      isAllNegative = 0;
      numP ++;
    }
  }
  vll p(0); vll n(0);
  FOR(i,N){
    if(a[i]<0){
      n.pb(a[i]); 
    }else if(a[i]>0){
  	  p.pb(a[i]);
  	}
  }
  sort(all(p)); reverse(all(p));
  sort(all(n)); //reverse(all(n)); //絶対値の大きい順
  
  //main
  ll ans = 1;
  //cout << isAllNegative << endl;
  
  if(N==K){
    FOR(i,K){
      ans = (ans*abs(a[i]))%MOD;
    }
    if(numN%2 == 1){
      ans *= -1; ans += MOD; 
    }
    cout << ans << endl; return 0;
  }else if(hasZero && numZero > N-K && numN%2==0){//0を選ばざるをえない場合。
    cout << 0 << endl; return 0;
  }else if(hasZero && numZero > N-K-1 && numN%2==1){//0を選ばざるをえない場合。
    cout << 0 << endl; return 0;
  }else if(isAllNegative && (K%2)==1){//負にならざるをえない場合。
    if(hasZero){
      cout << 0 << endl; return 0;
    }else{
      FOR(i,K){
        ans = (ans*abs(n[N-1-i])%MOD);
        //cout << ans << endl;
      }
      ans *= -1;
      ans += MOD;
      cout << ans << endl; return 0;
    }
  }else if(isAllNegative && (K%2)==0){//全て負の数だが答えは正。
    FOR(i,K){
      ans = (ans*abs(n[i])%MOD);
    }
    cout << ans << endl; return 0;
  }else{
    ll count = K; ll i=0, j=0; 
    while(count > 0){
      if(count >= 2){//負の数を2つ取るかどうか。
        if(i <= (ll)p.size()-2 && j <= (ll)n.size()-2){//負の数を2つ取る。
          if(p[i]*p[i+1] <= n[j]*n[j+1]){
            ans = (ans*(n[j]*n[j+1]%MOD))%MOD;
            j += 2; count -= 2;
          }else{
            ans = (ans*p[i])%MOD;
            i++; count--;
          }
        }else if(i >= ((ll)p.size()) && j <= (ll)n.size()-2){//残り0/2~個
           ans = ((n[j]*n[j+1]%MOD)*ans)%MOD;
           j += 2; count -= 2;
        }else if(i == ((ll)p.size())-1 && j <= (ll)n.size()-2){//残り0~1/2~個
           if(count%2 == 1){
             ans = (ans*p[i])%MOD;
           	 i++; count--; 
           }else{
             ans = ((n[j]*n[j+1]%MOD)*ans)%MOD;
           	 j += 2; count -= 2;
           }
        }else if(i <= ((ll)p.size())-1 && j >= ((ll)n.size())-1){//残り1~/0~1個
           ans = (ans*p[i])%MOD;
           i++; count--;
        }
      }else{//count == 1
        ans = (ans*p[i])%MOD;
        i++; count--;
      }
    }
  }
  
  // output
  cout << ans << endl;

  return 0;
}


Measured memory_bytes: 178912