#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; }

int main(){
    ll n,k;
    cin>>n>>k;
    ll ans=0;
    for(ll i=2;i<=sqrt(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;
        }
        ll tmp=0;
        if(t1%2==0&&t2%2==0) tmp+=t1*t2;
        else if (t1%2==1&&t2%2==0){
            tmp+=4*((t1/2)*(t2/2));
            tmp+=t2;
        }
        else if(t1%2==0&&t2%2==1){
            tmp+=4*((t1/2)*(t2/2));
            tmp+=t1;
        }
        else{
            tmp+=4*((t1/2)*(t2/2));
            tmp+=t1+t2;
        }
        if(i!=sqrt(k)){
            ans+=2*tmp;
        }
        else{
            ans+=tmp;
        }
    }
    
    cout<<ans<<endl;
    return 0;
}