#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); #define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t) { std::cin >> t; } templatevoid Scan(First& first, Rest&...rest) { std::cin >> first; Scan(rest...); } #define OUT(d) std::cout< c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector> c(m, std::vector(n));for(auto& r:c)for(auto& i:r)std::cin>>i; #define ALL(a) (a).begin(),(a).end() #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) for(int i=0;i=0;--i) #define FORLL(i, a, b) for(ll i=ll(a);i=ll(a);--i) #define REPLL(i, n) for(ll i=0;i=0;--i) #define PAIR std::pair #define PAIRLL std::pair #define IN(a, x, b) (a<=x && x(end-start).count();std::cerr<<"[Time:"< tmp(a);std::cout << #a << "\t:";for(int i=0; i(a.size()); ++i){std::cout << tmp.front() << "\n";tmp.pop();}std::cout << "\n";} #define CHMAX(a, b) a = (((a)<(b)) ? (b) : (a)) #define CHMIN(a, b) a = (((a)>(b)) ? (b) : (a)) #define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]" #define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;} //#define int ll using ll = long long; using ull = unsigned long long; constexpr int INFINT = 1 << 30; constexpr ll INFLL = 1LL << 60; constexpr double EPS = 0.0000000001; constexpr int MOD = 1000000007; constexpr double PI = 3.141592653589793238; ll powMod(ll n, ll p, ll mod) { ll res = 1; while (p) { if (p & 1) { res *= n; res %= mod; } n *= n; n %= mod; p >>= 1; } return res; } std::vector> primeFact(ll n) { std::vector> result; for (ll i = 2; i*i <= n; ++i) { int divCount = 0; if (n%i == 0) { do { ++divCount; n /= i; } while (n%i == 0); result.push_back(std::make_pair(i, divCount)); } } if (n != 1) { result.push_back(std::make_pair(n, 1)); } return result; } signed main() { INIT; VAR(ll, n, k); VEC(ll, a, n); std::map> map; REP(i, n) { auto t = primeFact(a[i]); for (const auto& x : t) { map[x.first].push(x.second); } } ll ans = 1; for (auto& s : map) { ll p = 0; ll N = static_cast(s.second.size()); REP(i, std::min(k, N)) { p += s.second.top(); s.second.pop(); } ans *= powMod(s.first, p, MOD); ans %= MOD; } OUT(ans)BR; return 0; }