Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Multiplication Table

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLet's consider a table consisting of *n* rows and *n* columns. The cell located at the intersection of *i*-th row and *j*-th column contains number *i* × *j*. The rows and columns are numbered starting from 1.

You are given a positive integer *x*. Your task is to count the number of cells in a table that contain number *x*.

Input

The single line contains numbers *n* and *x* (1 ≤ *n* ≤ 10^{5}, 1 ≤ *x* ≤ 10^{9}) — the size of the table and the number that we are looking for in the table.

Output

Print a single number: the number of times *x* occurs in the table.

Examples

Input

10 5

Output

2

Input

6 12

Output

4

Input

5 13

Output

0

Note

A table for the second sample test is given below. The occurrences of number 12 are marked bold.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/23/2019 16:49:08 (d3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|