Question

Ashutosh is a very mischievous student. His mathematics teacher wants to teach him a lesson so, he gave Ashutosh an array of positive integers Ar[a1, a2...., and where ai>0. prímesum is an integer which is equal to sum of all the prime factors of each element in Arr, modulus (10^6). Ashutosh's job is to find no of ways in which a set of primeSum' number of Os can be divided into k subsets modulus(10^9+7). Ashutosh is a little nervous, can you help him get out of this trouble ?

Answer 1

Answer:

माफ करना, जवाब नहीं पता