#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#define MOD 1000000007
#define mkp make_pair
typedef long long ll;
using namespace std;

ll N,K;

int main(){
  cin>>N;
  cin>>K;
  vector<ll> v;
  for(ll i=1;i*i<=K;i++){
    if(K%i==0){
      v.push_back(i);
    }
  }

  ll eq=0,ans=0;
  for(int i=0;i<v.size();i++){
    ll p=v[i],q=K/v[i];  
      ll x=0,y=0;
      if(p-1<=N) x=p-1;
      else{
        x=p-1-2*((p-1)-N);
        if(x<0) x=0;
      }

      if(q-1<=N) y=q-1;
      else{
        y=q-1-2*((q-1)-N);
        if(y<0) y=0;
      }

      if(p==q) eq+=x*y;
      else ans+=x*y;
  }

  cout<<ans*2+eq<<endl;

  return 0;
}