#include <bits/stdc++.h>
using namespace std;
long long t, n, m, g, o;
bool q = 0;
double y;
long long k, j, i, l, p = -1e9;
vector<vector<long long>> w(2e5), ww;
vector<int> visited(1e5, 0);
multiset<long long> qq;
string s, h, c;
char d, u = 'a';
unordered_map<int, int> mp;
int main() {
  cin >> n >> m;
  if (m == 1)
    cout << 1 << "\n";
  else {
    for (int i = 1; i <= n; i++) {
      if (m % i == 0 && m / i <= n) {
        k++;
      }
    }
    cout << k << "\n";
  }
  return 0;
}

### Prompt

Please formulate 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 t, n, m, g, o;
bool q = 0;
double y;
long long k, j, i, l, p = -1e9;
vector<vector<long long>> w(2e5), ww;
vector<int> visited(1e5, 0);
multiset<long long> qq;
string s, h, c;
char d, u = 'a';
unordered_map<int, int> mp;
int main() {
  cin >> n >> m;
  if (m == 1)
    cout << 1 << "\n";
  else {
    for (int i = 1; i <= n; i++) {
      if (m % i == 0 && m / i <= n) {
        k++;
      }
    }
    cout << k << "\n";
  }
  return 0;
}

```