CF992D Nastya and a Game

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

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,3] $ and $ [3,8,1] $ . Subsegment $ [6,3] $ has sum $ 9 $ and product $ 18 $ , so it suits us because . Subsegment $ [3,8,1] $ has sum $ 12 $ and product $ 24 $ , so it suits us because .