def prime_factors(n):
    factors = {}
    while n % 2 == 0:
        factors[2] = factors.get(2, 0) + 1
        n = n // 2
    i = 3
    while i * i <= n:
        while n % i == 0:
            factors[i] = factors.get(i, 0) + 1
            n = n // i
        i += 2
    if n > 2:
        factors[n] = 1
    return factors

def main():
    MOD = 10**9 + 7
    n, k = map(int, input().split())
    a = list(map(int, input().split()))
    
    all_primes = set()
    factors_list = []
    for num in a:
        factors = prime_factors(num)
        factors_list.append(factors)
        all_primes.update(factors.keys())
    
    primes = list(all_primes)
    result = 1
    for p in primes:
        exponents = []
        for factors in factors_list:
            exponents.append(factors.get(p, 0))
        exponents.sort(reverse=True)
        s = sum(exponents[:k]) if len(exponents) >= k else sum(exponents)
        if s > 0:
            result = (result * pow(p, s, MOD)) % MOD
    print(result)

if __name__ == "__main__":
    main()