Problem Statement

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

Input is given from Standard Input in the following format:
S T

Output

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

Constraints

• $0 \leq S \leq 100$
• $0 \leq T \leq 10000$
• S and T are integers.

Sample Input 1

1 0

Sample Output 1

4

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.

Sample Input 2

2 5

Sample Output 2

10

Sample Input 3

10 10

Sample Output 3

213

Sample Input 4

30 100

Sample Output 4

2471

见题面 Input 部分

见题面 Output 部分