#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll =  long long ;
using P = pair<int,int> ;
const int INF = 1e9;
const int MOD = 1000000007;

int main(){
    ll n,k;
    cin >> n >> k;
    ll ans = 0;
    for(ll i=2;i*i<=k;i++){
        if(k%i != 0) continue;
        ll p = i,q = k/i;
        if(p > 2*n || q > 2*n) continue;
        if(p==q) ans +=  (p>n+1 ? abs(2*n-p)+1 : p-1) * (q>n+1 ? abs(2*n-q)+1 : q-1);
        else ans += 2 * (p>n+1 ? abs(2*n-p)+1 : p-1) * (q>n+1 ? abs(2*n-q)+1 : q-1);
    }
    cout << ans << endl;
    return 0;
}