#include <bits/stdc++.h>
using namespace std;
int const N = 2e6 + 1;
long long n = 0, a = 0, b, c, k, x, y, z = 0, m = 0, mod = 1e9 + 7, sum1 = 0,
          sum2 = 0, ans = 0, mx = 0;
string s, q;
multiset<int> se;
set<int> ss;
multiset<int>::iterator it;
vector<long long> v, g;
map<int, int> mp;
int arr[505][505];
int main() {
  cin >> x >> k;
  for (int i = 1; i * i <= k; i++) {
    if (k % i == 0) {
      if (i > x || k / i > x) continue;
      n = k / i;
      if (n == i)
        ans++;
      else
        ans += 2;
    }
  }
  cout << ans << endl;
  return 0;
}

### Prompt

Construct a CPP code solution to the problem outlined:

Let'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 ≤ 105, 1 ≤ x ≤ 109) — 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. 

<image>

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int const N = 2e6 + 1;
long long n = 0, a = 0, b, c, k, x, y, z = 0, m = 0, mod = 1e9 + 7, sum1 = 0,
          sum2 = 0, ans = 0, mx = 0;
string s, q;
multiset<int> se;
set<int> ss;
multiset<int>::iterator it;
vector<long long> v, g;
map<int, int> mp;
int arr[505][505];
int main() {
  cin >> x >> k;
  for (int i = 1; i * i <= k; i++) {
    if (k % i == 0) {
      if (i > x || k / i > x) continue;
      n = k / i;
      if (n == i)
        ans++;
      else
        ans += 2;
    }
  }
  cout << ans << endl;
  return 0;
}

```