#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 7;
const int M = 1e6 + 7;
const int lim = 2e6;
const int P = 998244353;
const int inf = 0x3f3f3f3f;
int n, k, mx, x, ans;
int a[N], b[N], dp[N];
map<int, int> mp;
int main() {
  scanf("%d%d", &n, &x);
  for (int i = 1; i * i <= x; i++) {
    if (x % i == 0) {
      if (i <= n && x / i <= n && i * i != x) ans += 2;
      if (i * i == x && i <= n) ans++;
    }
  }
  printf("%d\n", ans);
  return 0;
}
