#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec) {
    os << vec[0];
    for (int i = 1; i < (int)vec.size(); i++) os << " " << vec[i];
    return os;
}
template<typename T> istream& operator>>(istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

vector<ll> getDivisions(ll N) {
    vector<ll> ans;
    ll i = 1;
    for (i = 1; i * i < N; i++) {
        if (N % i == 0) {
            ans.push_back(i);
            ans.push_back(N / i);
        }
    }
    if (i * i == N) ans.push_back(i);
    return ans;
}

// (a + c) * (b + d) = K
int main() {
    ll N, K; cin >> N >> K;
    vector<ll> divisions = getDivisions(K);

    ll ans = 0;
    for (auto div : divisions) {
        ll cnt1 = 0;
        if (min(N, div - 1) >= max(1LL, div - N)) {
            cnt1 = min(N, div - 1) - max(1LL, div - N) + 1;
        }
        //cerr << "cnt1: " << cnt1 << endl;
        //a >= 1, a <= N, a >= div - N, a <= div - 1
        //cnt1 = 0;
        //for (int a = 1; a <= div; a++) {
        //    if (a <= N && div - a <= N && div - a >= 1) cnt1++;
        //}
        //cerr << "cnt1: " << cnt1 << endl;
        ll cnt2 = 0;
        if (min(N, K / div - 1) >= max(1LL, K / div - N)) {
            cnt2 = min(N, K / div - 1) - max(1LL, K / div - N) + 1;
        }
        //cerr << "cnt2: " << cnt2 << endl;
        // c >= 1, c <= N, c >= K / div - N, c <= K / div - 1
        //cnt2 = 0;
        //for (int c = 1; c <= K / div; c++) {
        //    if (c <= N && K / div - c <= N && K / div - c >= 1) cnt2++;
        //}
        //cerr << "cnt2: " << cnt2 << endl;
        ans += cnt1 * cnt2;
    }

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