Given are N integers A_1,\ldots,A_N.

We will choose exactly K of these elements. Find the maximum possible product of the chosen elements.

Then, print the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).

Constraints

* 1 \leq K \leq N \leq 2\times 10^5
* |A_i| \leq 10^9

Input

Input is given from Standard Input in the following format:


N K
A_1 \ldots A_N


Output

Print the maximum product modulo (10^9+7), using an integer between 0 and 10^9+6 (inclusive).

Examples

Input

4 2
1 2 -3 -4


Output

12


Input

4 3
-1 -2 -3 -4


Output

1000000001


Input

2 1
-1 1000000000


Output

1000000000


Input

10 10
1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1


Output

999983200
n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort(key=lambda x: -abs(x))
mod=10**9+7
p=1
mm=0
for i in range(k):
    if a[i]<0:
        mm+=1
    p*=a[i]
    p%=mod
if n==k or mm%2==0:
    print(p)
    exit()
    
m=0
for i in a:
    if i<=0:
        m+=1
if m==n:
    p=1
    for i in range(k):
        p*=a[n-i-1]
        p%=mod
    print(p)
    exit()
b1=[]
b2=[]
for i in range(k):
    if len(b1)==0 and a[k-1-i]>=0:
        b1.append(a[k-1-i])
    if len(b2)==0 and a[k-1-i]<0:
        b2.append(a[k-1-i])
for i in range(n-k):
    if len(b1)==1 and a[k+i]<0:
        b1.append(a[k+i])
    if len(b2)==1 and a[k+i]>=0:
        b2.append(a[k+i])
f=0
if len(b1)==len(b2)==2:
    if b1[1]*b2[0]>=b1[0]*b2[1]:
        f=1
    else:
        f=2
elif len(b2)<2:
    f=1
else:
    f=2

if f==1:
    p*=b1[1]*pow(b1[0],mod-2,mod)
    print(p%mod)
    exit()
else:
    p*=b2[1]*pow(b2[0],mod-2,mod)
    print(p%mod)
    exit()
