#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define INF ((1LL<<62)-(1LL<<31))
#define all(a)  (a).begin(),(a).end()
#define rall(a)  (a).rbegin(),(a).rend()
typedef long long ll;
typedef pair<ll,ll> pl;
typedef tuple<ll,ll,ll> tupl;

vector<ll> enum_div(ll n) {
    vector<ll> ret;
    for(ll i=1;i*i<=n;i++) {
        if(n%i==0) {
            ret.push_back(i);
            if(n/i!=i) ret.push_back(n/i);
        }
    }
    sort(ret.begin(),ret.end());
    return ret;
    //const auto &res = enum_div(n);
}

int main()
{
    ll n,k;
    cin >> n >> k;
    const auto &res = enum_div(k);
    int x=res.size();
    ll ans=0;
    rep(i,x) {
        ll j=k/res[i];
        if(res[i]==1||j==1||res[i]>2*n||j>2*n) continue;
        ll y=n-(res[i]-n)+1;
        ll z=n-(j-n)+1;
        if(res[i]-1<=n) y=res[i]-1;
        if(j-1<=n) z=j-1;
        if(y<0||z<0) continue;
        ans+=y*z;
    }
    cout << ans << endl;
    return 0;
}