#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;
}
