#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define pi       acos(-1)
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))  
#define REVERSE(v) reverse(ALL(v))
#define F first
#define S second
#define ppb pop_back
#define GCD(m,n) __gcd(m,n)
#define LCM(m,n) (m*n)/GCD(m,n)
#define rep(i,a,n)  for(int i=a ; i<n ; i++)
#define repe(i,a,n) for(int i=a;i<=n;i++)
#define rev(i,a,b) for(int i=a;i>=b;i--)
////-------------------------------------------------------------------------
#define ld long double 
#define int long long ////////////
////define ll long long
////--------------------------------------------------------------------------
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef vector<pii > vpii;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef map<int,int> mii;
typedef unordered_map<int,int> umii;
typedef map<char,int> mci;
////--------------------------------------------------------------------------
#define itv for(auto it= v.begin(); it != v.end(); ++it )
#define present(container, element) (container.find(element) != container.end())
#define cpresent(container, element) (find(ALL(container),element) != container.end())
#define   bs binary_search
#define  lb(v,val)  lower_bound(ALL(v), val)
#define  ub(v,val)  upper_bound(ALL(v), val)
#define Max(x,y,z) max(x,max(y,z))
#define Min(x,y,z) min(x,min(y,z))
#define maxc(v) *max_element(ALL(v))
#define minc(v) *min_element(ALL(v))
#define isvowel(a) (a=='a'||a=='e'||a=='i'||a=='o'||a=='u')
////--------------------------------------------------------------------------
 /*
#define dbg1(a) cout<<" *"<<a<<" ";
#define dbg2(a,b) cout<<" *"<<a<<" **"<<b<<" "     /////
#define dbg cout<<"move"
*/
#define nl "\n"
#define vin(v,n)   vi v(n); rep(i,0,n)  cin>>v[i]
#define dbg cerr <<"At line "<<__LINE__<<" move "<<nl
#define dbg1(x) cerr <<"At line "<<__LINE__<<" "<<#x<<"="<<x<<nl
#define dbg2(x,y) cerr <<"At line "<<__LINE__<<" "<<#x<<"="<<x<<" "<<#y<<"="<<y<<nl
#define dbg3(x,y,z) cerr <<"At line "<<__LINE__<<" "<<#x<<"="<<x<<" "<<#y<<"="<<y<<" "<<#z<<"="<<z<<nl
#define prv(v)     rep(i,0,sz(v))  cerr<<v[i]<<" "; cerr<<endl
#define sz(s)         (int)((s).size())
#define coutsp(k)   cout<<setprecision(k)  //set precision (total length k icluding decimal and non decimal)
#define coutfsp(k)   cout<<fixed<<setprecision(k)  //fixed set precision(after decimal fixing)
#define trav(a, x) for(auto& a : x)
#define display(x) trav(a,x) cout<<a<<" ";cout<<endl
#define displaycerr(x) trav(a,x) cerr<<a<<" ";cerr<<endl

#define MOD 1000000007   
#define POD 998244353    
#define INF   (int)1e18   //------
//-------------------------------------------------------------------------------------------------

//--------------------------------Global VARIABLE--------------------------------------------------

 
//-------------------------------------------------------------------------------
void do2win(int &test)
{
  int nn,k;  cin>>nn>>k;
  vin(a,nn);

  vi p,n; int z=0;
  rep(i,0,nn)
  {
    if(a[i]>0)
      p.pb(a[i]);
    if(a[i]<0)
      n.pb(-a[i]);
    if(a[i]==0)
      z++;
  }
  SORT(p); SORT(n); REVERSE(n);  REVERSE(p);

   int p1=0,p2=0;
  if(((((sz(n)/2)*2)+sz(p)>=k)&&(k%2==0))||((k&1)&&(sz(p)>0)&&(((sz(n)/2)*2)+sz(p)>=k-1)))
  {
    int co=0;
    int ans=1;

    if(k&1)
    {
      co++;
      ans*=p[p1];
      p1++;
    }

    while(co!=k)
    {
    if(p2>=sz(n)-1||((p1<=sz(p)-2)&&p[p1]*p[p1+1]>=n[p2]*n[p2+1]))
    {
      ans*=(p[p1]*p[p1+1])%MOD;
      ans%=MOD;
      p1+=2;
      co+=2;
    }
    else
    {
      ans*=(n[p2]*n[p2+1])%MOD;
      p2+=2;
      ans%=MOD;
      co+=2;
    }
    }

    cout<<ans;  return;

  }
  //+



  //
  if(z>0)
  {
    cout<<0;  return;
  }

 //-

  REVERSE(n);  REVERSE(p);

   p1=0,p2=0;

    int co=0;
    int ans=1;


    while(co!=k)
    {
    if(p2>=sz(n)||((p1<=sz(p)-1)&&p[p1]<=n[p2]))
    {
      ans*=(p[p1])%MOD;
      ans%=MOD;
      p1++;
      co++;
    }
    else
    {
      ans*=(n[p2])%MOD;
      p2+=1;
      ans%=MOD;
      co++;
    }
    }

    ans*=-1;

    ans%=MOD; ans+=MOD; ans%=MOD;

    cout<<ans;  return;
 


}
//-------------------------------------------------------------------------------
 
signed main()
{

   // #ifndef ONLINE_JUDGE
   //  cerr<<(1000*clock())/CLOCKS_PER_SEC<<"ms";
   // #endif      

///+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
   FAST; 
// cout<<fixed<<setprecision(20);
///+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
   
   int test;  test=1;    
///////---------------------------------|||||
            // cin>>test;        ////////>>>>>>>
//////----------------------------------|||||

    for(int i=1;i<=test;i++)
    {
       // cout<<"Case #"<<i<<": ";

      do2win(i);
      cout<<nl;   //  IMPORTANT FOR NEXT LINE     
    }

   return 0;
}


Measured memory_bytes: 6872