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.

娜斯佳生日时又收到了一个数组，这个数组可用于在拜特兰德（Byteland）传统游戏中进行操作。然而，要进行游戏，玩家首先需要选择该数组的一个子段，使得满足条件：，其中 $p$ 是该子段中所有整数的乘积，$s$ 是它们的和，而 $k$ 是对所有子段给定的常数。

娜斯佳想知道，该数组中有多少个子段满足上述条件。数组的一个子段是指数组中若干连续的整数。

The first line contains two integers n and k (1 ≤ n ≤ 2·105, 1 ≤ k ≤ 105), where n is the length of the array and k is the constant described above.

The second line contains n integers _a_1, _a_2, ..., a__n (1 ≤ a__i ≤ 108) — the elements of the array.

第一行包含两个整数 $n$ 和 $k$（$1 \leq n \leq 2 \cdot 10^5$，$1 \leq k \leq 10^5$），其中 $n$ 表示数组的长度，$k$ 是上述描述的常数。

第二行包含 $n$ 个整数 $a_1,\ a_2,\ \dots,\ a_n$（$1 \leq a_i \leq 10^8$）—— 数组的元素。

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.

在唯一的一行中输出满足其上乘积与和的比值等于 $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 .

在第一个例子中，唯一的子段是 [1]。其和为 1，积为 1，因此满足条件，因为 。

在第二个例子中有两个满足条件的子段：[6, 3] 和 [3, 8, 1]。子段 [6, 3] 的和为 9，积为 18，因此满足条件，因为 。子段 [3, 8, 1] 的和为 12，积为 24，因此满足条件，因为 。