We are given number of bins N and an integer K. We have to pack numbers in bins such than product of all numbers in bins is equal to K and sum of numbers in bin is minimum ? Limits: N <=1000, K <=10^9