#include <bits/stdc++.h>
using namespace std;
void read(int &k) {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  k = x * f;
}
int n, k;
long long ans;
int st[100005];
int main() {
  read(n), read(k);
  for (int i = 1; i <= sqrt(k); i++) {
    if (i * i == k && i == sqrt(k) && i <= n)
      ans++;
    else if (k % i == 0 && i <= n && k / i <= n)
      ans += 2;
  }
  printf("%I64d\n", ans);
  return 0;
}

### Prompt

In Cpp, your task is to solve 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;
void read(int &k) {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  k = x * f;
}
int n, k;
long long ans;
int st[100005];
int main() {
  read(n), read(k);
  for (int i = 1; i <= sqrt(k); i++) {
    if (i * i == k && i == sqrt(k) && i <= n)
      ans++;
    else if (k % i == 0 && i <= n && k / i <= n)
      ans += 2;
  }
  printf("%I64d\n", ans);
  return 0;
}

```