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