B'Nastya received one more array on her birthday, this array can be used to play a traditional Byteland game on it. However, to play the game the players should first select such a subsegment of the array that , where p is the product of all integers on the given array, s is their sum, and k is a given constant for all subsegments. Nastya wonders how many subsegments of the array fit the described conditions. A subsegment of an array is several consecutive integers of the array. The first line contains two integers n and k (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892 xc2 xb7105, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105), where n is the length of the array and k is the constant described above. The second line contains n integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89108) -- the elements of the array. In the only line print the number of subsegments such that the ratio between the product and the sum on them is equal to k. In the first example the only subsegment is [1]. The sum equals 1, the product equals 1, so it suits us because . There are two suitable subsegments in the second example -- [6, xe2 x80 x893] and [3, xe2 x80 x898, xe2 x80 x891]. Subsegment [6, xe2 x80 x893] has sum 9 and product 18, so it suits us because . Subsegment [3, xe2 x80 x898, xe2 x80 x891] has sum 12 and product 24, so it suits us because . '...