import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.util.*
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min

val MOD = 1_000_000_007L

class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  fun solve() {
    val N = ni()
    val K = ni()
    val A = nal(N).toMutableList()
    val m = A.filter { it < 0 }.toMutableList()
    val p = A.filter { it > 0 }.toMutableList()
    val zero = A.count { it == 0L }

    debug{p.toString()}
    debug{m.toString()}

    // > 0
    if (min(K / 2 * 2, m.size / 2 * 2) + p.size >= K) {
      var ans = 1L
      p.sort()
      p.reverse()
      m.sort()
      var ixP = 0
      var ixM = 0
      var k = 0

      fun add(x: Long) {
        ans = x % MOD * ans % MOD
      }

      if (K % 2 == 1) {
        ans *= p[ixP++]
        k++
      }

      while(k < K) {
        if (ixP <= p.size - 2 && ixM <= m.size - 2) {
          val aP = p[ixP]
          val bP = p[ixP + 1]
          val aM = m[ixM]
          val bM = m[ixM + 1]
          if (aP * bP > aM * bM) {
            ixP += 2
            add(aP * bP)
          } else {
            ixM += 2
            add(aM * bM)
          }

        } else if (ixP <= p.size - 2) {
          val a = p[ixP++]
          val b = p[ixP++]
          add(a * b)
        } else {
          val a = m[ixM++]
          val b = m[ixM++]
          add(a * b)
        }

        k += 2
      }

      out.println(ans)

    } else if (zero > 0) {
      out.println(0)
    // < 0
    } else {
      A.sortWith(compareBy { abs(it) })
      debug{A.joinToString(" ")}
      var ans = 1L
      for (i in 0 until K) {
        ans = (ans * (MOD + A[i]) % MOD) % MOD
      }
      out.println(ans)
    }
  }













































  private val isDebug = try {
    // なんか本番でエラーでる
    System.getenv("MY_DEBUG") != null
  } catch (t: Throwable) {
    false
  }

  private var tokenizer: StringTokenizer? = null
  private val reader = BufferedReader(InputStreamReader(stream), 32768)
  private fun next(): String {
    while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
      tokenizer = StringTokenizer(reader.readLine())
    }
    return tokenizer!!.nextToken()
  }

  private fun ni() = next().toInt()
  private fun nl() = next().toLong()
  private fun ns() = next()
  private fun na(n: Int, offset: Int = 0): IntArray {
    return map(n) { ni() + offset }
  }
  private fun nal(n: Int, offset: Int = 0): LongArray {
    val res = LongArray(n)
    for (i in 0 until n) {
      res[i] = nl() + offset
    }
    return res
  }

  private fun na2(n: Int, offset: Int = 0): Array<IntArray> {
    val a  = Array(2){IntArray(n)}
    for (i in 0 until n) {
      for (e in a) {
        e[i] = ni() + offset
      }
    }
    return a
  }

  private inline fun map(n: Int, f: (Int) -> Int): IntArray {
    val res = IntArray(n)
    for (i in 0 until n) {
      res[i] = f(i)
    }
    return res
  }

  private inline fun debug(msg: () -> String) {
    if (isDebug) System.err.println(msg())
  }

  private fun debug(a: LongArray) {
    debug { a.joinToString(" ") }
  }

  private fun debug(a: IntArray) {
    debug { a.joinToString(" ") }
  }

  private fun debug(a: BooleanArray) {
    debug { a.map { if (it) 1 else 0 }.joinToString("") }
  }

  private fun debugDim(A: Array<LongArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }
  private fun debugDim(A: Array<IntArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }

  /**
   * 勝手にimport消されるのを防ぎたい
   */
  private fun hoge() {
    min(1, 2)
    max(1, 2)
    abs(-10)
  }
}

fun main() {
  val out = java.io.PrintWriter(System.out)
  Solver(System.`in`, out).solve()
  out.flush()
}


Measured memory_bytes: 68256