#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
long long n,k,c,ac,a[111111],l,r,p,s=1,MOD=1000000007;
int main()
{
    /*freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);*/
    cin>>n>>k;
    for (int i=1;i<=n;i++) cin>>a[i];
    sort(a+1,a+n+1);
    c=1;ac=1;
    if (k%2==1){ac=abs(a[n]);if (a[n]==0)c=0;if (a[n]<0)c=-1;}
    l=1;r=n-k%2;
    for  (int i=1;i<=k/2;i++){
         if (c*1ll*a[l]*a[l+1]>c*1ll*a[r]*a[r-1]){
                                                  p=(a[l]*1ll*a[l+1])%MOD;
                                                  s=(s*1ll*p)%MOD;
                                                  l+=2;}
         else {
               p=(a[r]*1ll*a[r-1])%MOD;
               s=(s*1ll*p)%MOD;
               r-=2;}
         }
    s=(s*1ll*c*ac)%MOD;
    if (s<0)s+=MOD;
    cout<<s;
    return 0;
}