#include <bits/stdc++.h>
using namespace std;

//repetition
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)

//container util
#define all(x) (x).begin(),(x).end()

//typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;

//const value
//const ll MOD = 1e9 + 7;
//const int dx[] = {0,1,0,-1};//{0,0,1,1,1,-1,-1,-1};
//const int dy[] = {1,0,-1,0};//{1,-1,0,1,-1,0,1,-1};

//conversion
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
inline ll toLL(string s) {ll v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}


set<PLL> divisors(ll n) {
    set<PLL> res;
    for(ll i = 1; i*i <= n; ++i) {
        if(n % i != 0) continue;
        ll x = i;
        ll y = n/i;
        if(x < y){
          x = n/i;
          y = i;
        }
        if(y == 1) continue;
        res.insert({x,y});
    }
    return res;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll n,k;
  cin >> n >> k;
  set<PLL> v = divisors(k);
  ll ans = 0;
  for(PLL p: v){
    ll x = p.first;
    ll y = p.second;
    ll cnt1 = x-1;
    ll cnt2 = y-1;

    if(cnt1 > n){
      cnt1 -= 2*(cnt1-n);
    }
    if(cnt2 > n){
      cnt2 -= 2*(cnt2-n);
    }

    ans += 2*max<ll>(0,cnt1)*max<ll>(0,cnt2);
  }
  cout << ans << endl;
  return 0;
}