/**
  @file main.cpp
  @title No.864 四方演算
  @url https://yukicoder.me/problems/no/864
**/

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
#define ALL(obj) (obj).begin(), (obj).end()
#define REP(i, N) for (int i = 0; i < (N); ++i)

vector<int> make_divisors(int n) {
  vector<int> divisors;
  for (int i = 1; i < (int)sqrt(n) + 1; i++) {
    if (n % i == 0) {
      divisors.push_back(i);
      if (i != (n / i)) {
        divisors.push_back(n / i);
      }
    }
  }
  sort(ALL(divisors));
  return divisors;
}

int seps(int q, int N) {
  if (q < N) {
    return q - 1;
  } else {
    int ret = 0;
    for (int i = 1; i < q; i++) {
      if (i <= N && q - i <= N) ret++;
    }
    return ret;
  }
}

template <class T>
void show(vector<T>& v) {
  for (uint i = 0; i < v.size(); i++) {
    cout << v[i] << " ";
  }
  cout << "\n";
}

int main() {
  int N, K;
  cin >> N >> K;

  vector<int> divs = make_divisors(K);
  // show(divs);

  int ans = 0;
  for (auto i : divs) {
    if (i == 1 || i == K) {
      continue;
    }
    int j = K / i;

    ans += seps(i,N) * seps(j,N);
  }

  cout << ans << endl;
  return 0;
  }