How many triples of non-negative integers $(a, b, c)$ satisfy $a+b+c \leq S$ and $a \times b \times c \leq T$?

Input is given from Standard Input in the following format: >$S$ $T$ #### Constraints - $0 \leq S \leq 100$ - $0 \leq T \leq 10000$ - $S$ and $T$ are integers.

Print the number of triples of non-negative integers $(a,b,c)$ satisfying the conditions.

***For Sample #1:*** The triples $(a,b,c)$ satisfying the conditions are $(0,0,0)$, $(0,0,1)$, $(0,1,0)$, and $(1,0,0)$ ― there are four of them.

AtCoder [ABC214B]