#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;


ll calc(ll s,ll t){
    ll mi = max(1ll, s-t);
    ll ma = min(t, s-1);
    return max(ma-mi+1,0ll);
}
int main(){
    ll n,k;
    cin>>n>>k;
    ll ans = 0;
    for(ll i = 1 ; i*i <= k ; ++i){
        if(i*i==k){
            ans += calc(i,n)*calc(i,n);
        }
        else if(k%i==0){
            ans += 2*calc(i,n)*calc(k/i,n);
        }
    }
    cout<<ans<<endl;
    return 0;
}