//#include "testlib.h"
//#include <spoj.h>

#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <assert.h>
#include <time.h>
#include <memory.h>
#include <set>
#include <numeric>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_map>

using namespace std;

const int mod = 1e9+7;

int a[222222];

int cmp(int a, int b) {
    return abs(b) > abs(a);
}

int main() {
    ios::sync_with_stdio(0);
    int t = 1, sn = 0;
    //cin >> t; assert(1 <= t && t <= 1e5);
    while (t --> 0) {
        int n, k;
        cin >> n >> k;
        bool zero = 0;
        for(int i = 0; i < n; ++i) {
            cin >> a[i];
            assert(-1e9 <= a[i] && a[i] <= 1e9);
            zero |= (a[i] == 0);
        }
        sort(a, a+n, cmp);
        int sn = 1;
        vector<int> nums;
        int gneg = -1e9-1, gpos = 1e9+1;
        for(int i = 0, id = n-1; i < k; ++i, id--) {
            if (a[id] < 0) sn *= -1;
            nums.push_back(a[id]);
            if (a[id] < 0)
                gneg = max(gneg, a[id]);
            else
                gpos = min(gpos, a[id]);
        }
        
        if (sn > 0) {
            int ans = 1;
            for(auto x : nums)
                ans = (ans * 1ll * x) % mod;
            cout << (ans + mod) % mod << "\n";
        } else {
            int mn = 1, mx = -1;
            for(int i = 0; i < n-k; ++i) {
                mn = min(mn, a[i]);
                mx = max(mx, a[i]);
            }
            bool g1 = gneg != -1e-9-1 && mx != -1;
            bool g2 = gpos != 1e9+1 && mn != 1;
            if (g1 && g2) {
                int val, repl;
                if (mx * 1ll * gpos > mn * 1ll * gneg)
                    val = gneg, repl = mx;
                else
                    val = gpos, repl = mn;
                
                for(int i = 0; i < k; ++i)
                    if (nums[i] == val) {
                        nums[i] = repl;
                        break;
                    }
                int ans = 1;
                for(auto x : nums)
                    ans = (ans * 1ll * x) % mod;
                cout << (ans + mod) % mod << "\n";
            } else if (g1) {
                for(int i = 0; i < k; ++i)
                    if (nums[i] == gneg) {
                        nums[i] = mx;
                        break;
                    }
                int ans = 1;
                for(auto x : nums)
                    ans = (ans * 1ll * x) % mod;
                cout << (ans + mod) % mod << "\n";
            } else if (g2) {
                for(int i = 0; i < k; ++i)
                    if (nums[i] == gpos) {
                        nums[i] = mn;
                        break;
                    }
                int ans = 1;
                for(auto x : nums)
                    ans = (ans * 1ll * x) % mod;
                cout << (ans + mod) % mod << "\n";
            } else {
                if (zero)
                    cout << "0\n";
                else {
                    int ans = 1;
                    for(int i = 0; i < k; ++i)
                        ans = (ans * 1ll * a[i]) % mod;
                    cout << (ans + mod) % mod << "\n";
                }
            }
            
            
        }
    }
    return 0;
}

Measured memory_bytes: 5104