#include <bits/stdc++.h>
using namespace std;
const int N = 180000;
int n, b;
set<pair<int, int>> ans;
int main() {
  cin >> n >> b;
  int d = int(pow(b, 0.5) + 2);
  if (d > n) d = n;
  for (int i = 1; i <= n; ++i) {
    if (b % i == 0) {
      if (b / i <= n) ans.insert(make_pair(i, b));
    }
  }
  cout << ans.size() << endl;
  return 0;
}
