def ascan; gets.split.map(&:to_i);end

def mypow(x,w,md)
    y=1
    while 0<w
        y = (x*y)%md if w.odd?
        w/=2
        x = (x*x)%md
    end
    y
end

require 'prime'

MD = 1000000007

N,K = ascan
aa = ascan.sort

# p aa.combination(K).map{|z| z.reduce(:*)}.reduce(:lcm)%MD

primes = aa.reduce({}) do |s,a|
    if a.prime?
        s[a] ||= []
        s[a] << 1
    else
        Prime.prime_division(a).each do |k,v|
            s[k] ||= []
            s[k] << v
        end
    end
    s
end

ans = 1

primes.each do |k, v|
    ans *= mypow(k,(v.sort.pop([K,v.size].min).reduce(:+)),MD)
    ans %= MD
end

p ans

# case
# 3 2
# 100 11 10