#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

//nをm個以下に分割する→pf[m][n]
//空箱がないようにする→pf(k,n)-pf(k-1,n)をすればいい
const int N=2000,M=2000;
ll pf[M+1][N+1];
void PARinit(){
    pf[0][0]=1;
    for(int i=1;i<=M;i++){
        for(int j=0;j<=N;j++){
            if(j-i>=0){
                pf[i][j]=(pf[i-1][j]+pf[i][j-i])%mod;
            } else{
                pf[i][j]=pf[i-1][j];
            }
        }
    }
}
int main(){
    ll n,k;
    cin>>n>>k;
    ll ans=0;
    for(ll i=2;i<=k;i++){
        if(k%i) continue;
        ll num=k/i;
        if(i>2*n||num>2*n) continue;
        ll t1,t2;
        if(i<=n+1){
            t1=i-1;
        }
        else{
            t1=i-1-(i-1-n)*2;
        }
        if(num<=n+1){
            t2=num-1;
        }
        else{
            t2=num-1-(num-1-n)*2;
        }
        if(t1%2==0&&t2%2==0) ans+=t1*t2;
        else if (t1%2==1&&t2%2==0){
            ans+=4*((t1/2)*(t2/2));
            ans+=t2;
        }
        else if(t1%2==0&&t2%2==1){
            ans+=4*((t1/2)*(t2/2));
            ans+=t1;
        }
        else{
            ans+=4*((t1/2)*(t2/2));
            ans+=t1+t2;
        }
    }
    cout<<ans<<endl;
    return 0;
}