// includes {{{
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<random>
#include<cassert>
#include<bitset>
#include<cstdlib>
// #include<deque>
// #include<multiset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;

// ab + bc + cd + da = K
// a(b + d) + c(b + d)
// (a + c)(b + d) = K

// O(N^.5)
/// --- divisor {{{ ///
#include <vector>
vector< ll > divisor(ll n) {
  vector< ll > res;
  for(ll i = 1; i * i <= n; i++) {
    if(n % i == 0) {
      res.emplace_back(i);
      if(i != n / i) res.emplace_back(n / i);
    }
  }
  return res;
}
/// }}}--- ///


int main() {
  std::ios::sync_with_stdio(false), std::cin.tie(0);
  ll n, k;
  cin >> n >> k;
  auto ds = divisor(k);
  ll ans = 0;
  for(auto d : ds) {
    ans += min<ll>(max<ll>(n * 2 - (d - 1), 0), d - 1) * min<ll>(max<ll>(n * 2 - (k / d - 1), 0), k / d - 1);
  }
  cout << ans << endl;
  return 0;
}