#include <bits/stdc++.h>
using namespace std;
long long gen(long long m, long long n) {
  vector<long long> v;
  long long i, sum = 0;
  for (i = 1; i * i < n; ++i)
    if (n % i == 0 && i != 1 && i <= m && n / i <= m)
      v.push_back(i), v.push_back(n / i);
  if (i * i == n && i <= m && i != 1) v.push_back(i);
  if (m >= n)
    return v.size() + 2;
  else
    return v.size();
}
int main() {
  long long n, m, sum = 0;
  cin >> m >> n;
  if (m == 1 && n == 1) {
    cout << "1";
    return 0;
  }
  if (m == 1) {
    cout << "0";
    return 0;
  }
  if (n == 1) {
    cout << "1";
    return 0;
  }
  if (m == 0) {
    cout << "0";
    return 0;
  }
  cout << gen(m, n);
  return 0;
}

### Prompt

Generate a CPP solution to the following problem:

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;
long long gen(long long m, long long n) {
  vector<long long> v;
  long long i, sum = 0;
  for (i = 1; i * i < n; ++i)
    if (n % i == 0 && i != 1 && i <= m && n / i <= m)
      v.push_back(i), v.push_back(n / i);
  if (i * i == n && i <= m && i != 1) v.push_back(i);
  if (m >= n)
    return v.size() + 2;
  else
    return v.size();
}
int main() {
  long long n, m, sum = 0;
  cin >> m >> n;
  if (m == 1 && n == 1) {
    cout << "1";
    return 0;
  }
  if (m == 1) {
    cout << "0";
    return 0;
  }
  if (n == 1) {
    cout << "1";
    return 0;
  }
  if (m == 0) {
    cout << "0";
    return 0;
  }
  cout << gen(m, n);
  return 0;
}

```