A11011. Card Game Again

Vova again tries to play some computer card game.

The rules of deck creation in this game are simple. Vova is given an existing deck of $n$ cards and a magic number $k$ . The order of the cards in the deck is fixed. Each card has a number written on it; number $a_{i}$ is written on the $i$ -th card in the deck.

After receiving the deck and the magic number, Vova removes $x$ (possibly $x=0$ ) cards from the top of the deck, $y$ (possibly $y=0$ ) cards from the bottom of the deck, and the rest of the deck is his new deck (Vova has to leave at least one card in the deck after removing cards). So Vova's new deck actually contains cards $x+1$ , $x+2$ , ... $n-y-1$ , $n-y$ from the original deck.

Vova's new deck is considered valid iff the product of all numbers written on the cards in his new deck is divisible by $k$ . So Vova received a deck (possibly not a valid one) and a number $k$ , and now he wonders, how many ways are there to choose $x$ and $y$ so the deck he will get after removing $x$ cards from the top and $y$ cards from the bottom is valid?

The first line contains two integers $n$ and $k$ ( $1<=n<=100000$ , $1<=k<=10^{9}$ ).

The second line contains $n$ integers $a_{1}$ , $a_{2}$ , ..., $a_{n}$ ( $1<=a_{i}<=10^{9}$ ) — the numbers written on the cards.

Print the number of ways to choose $x$ and $y$ so the resulting deck is valid.

In the first example the possible values of $x$ and $y$ are:

1. $x=0,y=0$ ;
2. $x=1,y=0$ ;
3. $x=2,y=0$ ;
4. $x=0,y=1$ .