/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */

#include <iostream>
#include <fstream>

#include <iostream>
#include "bits/stdc++.h"

using namespace std;
typedef unsigned long long ll;
typedef int                     integer;
#define int                     long long
#define ii                      pair<int,int>
#define vii                     vector<pair<int,int>>
#define vi                      vector<int>
#define vvi                     vector<vector<int>>
#define f(a,b,c)                for(int a=b;a<c;a++)
#define s(x)                    in>>x
#define s2(x,y)                 in>>x>>y
#define s3(x,y,z)               in>>x>>y>>z
#define s4(x,y,z,w)             in>>x>>y>>z>>w
#define p(x)                    out<<(x)<<endl
#define p2(x,y)                 out<<(x)<<' '<<(y)<<endl
#define p3(x,y,z)               out<<(x)<<' '<<(y)<<' '<<(z)<<endl
#define p4(x,y,z,w)             out<<(x)<<' '<<(y)<<' '<<(z)<<' '<<(w)<<endl
#define p1d(a,n)                for(int ix=0;ix<n;ix++) out<<a[ix]<<(ix == n-1? '':' '); out<<endl
#define p2d(a,n,m)              for(int ix=0;ix<n;ix++){ for(int jx=0;jx<m;jx++) out<<a[ix][jx]<<" "; out<<endl;}
#define pl(x)                   out<<(x)
#define pll(x)                  out<<(x)<<' '
#define range(v)                v.begin(),v.end()
#define rst(x)                  memset(x, -1, sizeof(x))
#define UNVISITED               -1
#define VISITED                 0
#define EXPLORED                2

#define EACH(x, a) for (auto& x: a)
template<class T> void read_v(T& x, std::istream& in) {
    in >> (x);
}
template<class A> void read_vec(vector<A>& x, std::istream& in) {
    EACH(a, x)
        read_v(a, in);
}

bool sortpairbysec(const pair<int,int> &a,const pair<int,int> &b){return (a.second < b.second);}
template <typename T>
T factmod(T a, T modulus){ int res = 1, i; for (i = 2; i <= a; i++){ res *= i; res%=modulus;} return res; }
template <typename T>
int powmod(T a,T b,int m){ int ans=1; while(b>0){if(b&1){ans*=a;ans%=m;}a*=a;a%=m;b>>=1;} return ans; }
template <typename T>
int power(T a, T b){ int ans=1; while(b>0){if(b&1){ans*=a;}a*=a;b>>=1;}return ans;}

const int CMOD = 1e9 + 7;

void product_mod(int& a, int b){
    b %= CMOD;
    b = (b >= 0?b:(b+CMOD));
    a *= b;
    a %= CMOD;
    a = (a >= 0?a:(a+CMOD));
    return;
}

// https://www.geeksforgeeks.org/maximum-product-subsequence-size-k/
void ssolve(std::istream& in, std::ostream& out){
    int n, k; s2(n, k);
    vi a(n);
    f(i, 0, n){
        s(a[i]);
    }
    sort(range(a));

    // only elements <= 0 and there is one 0, and k odd -> choose one 0
    if(a[n - 1]==0&&k%2==1){
        p(0); return;
    }
    // only elements < 0 -> choose k min abs value elements
    if(a[n - 1] < 0 && (k%2==1)){
        int ans = 1;
        for(int i = n - 1; i >= n - k; i--){
            product_mod(ans, a[i]);
        }
        p(ans); return;
    }


    int ans = 1;
    int l = 0, r = n - 1;

    // there is at least one positive element
    if(k%2==1){
        product_mod(ans, a[r]);
        r--; k--;
    }

    // k even -> choose k/2 pairs
    for(int pair = 0; pair < k/2; pair++){
        int left_end = (a[l] * a[l + 1]);
        int right_end = (a[r] * a[r - 1]);
        if(left_end > right_end){
            product_mod(ans, left_end);
            l += 2;
        }else{
            product_mod(ans, right_end);
            r -= 2;
        }
    }
    ans = (ans>0?(ans%CMOD):(ans+CMOD)%CMOD);
    p(ans);
    return;
}

class EMultiplication4 {
public:
void solve(std::istream& in, std::ostream& out) {
    ios_base::sync_with_stdio(false);
    in.tie(nullptr);out.tie(nullptr);
    int t;
    int READ = 0;
    if(READ) s(t);
    else t = 1;
    while(t--){
        ssolve(in, out);
    }
}
};

integer main() {
    EMultiplication4 solver;
    std::istream& in(std::cin);
     std::ostream& out(std::cout);
     solver.solve(in, out);
}

Measured memory_bytes: 4800