SOLVE
LATER
Joseph loves questions with arrays! His friend Nick gave him interesting problem!
Initially, there is an array with n positive integers, numbered 1 through n. Let quality be a multiplication of all integers from the array. More formally, quality = a_{1} * a_{2} * a_{3} * ... * a_{n}. Nick is interested in number of arrays with size of k with same quality.
Of course, Joseph found that this problem is really hard for him. So, he needs your help.
Input format
The first line contains a single integer n and k — the number of positive integers in the array and the size of the arrays you have to count, respectively.
The next line contains n integers a_{1}, a_{2}, ..., a_{n} — an array which was described above.
Output format
Print the answer modulo 10^{9} + 7.
Note: The numbers in all k-sized arrays must be positive.
Constraints
Subtasks
The quality of an array is equal to 3 * 2 = 6, so there are 9 arrays with size 3 and quality is 6.