Multiplication Table

Source: Codeforces

Version: Phuoc Hung OJ Extended

Problem Statement

Given an $n$-by-$n$ multiplication table with cell $(i,j)=i\times j$ for 1-based indices, count all cells whose value equals $x$. Distinct positions count separately.

Input

One line contains integers $n,x$.

Output

Print the number of cells equal to $x$.

Subtasks

• Subtask 1 (20%): $1\le n\le 100$; $1\le x\le 10^9$.

• Subtask 2 (30%): $1\le n\le 1000$; $1\le x\le 10^9$.

• Subtask 3 (50%): $1\le n\le 100000$; $1\le x\le 10^9$.

Examples

Example 1

Input:

10 5

Output:

2

Explanation:

Cells with product 5: (1, 5), (5, 1); total 2.

Example 2

Input:

6 12

Output:

4

Explanation:

Cells with product 12: (2, 6), (3, 4), (4, 3), (6, 2); total 4.