#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int> >
#define vvl std::vector<std::vector<ll> >
#define MODs 1000000007;
typedef long long int ll;
using namespace std;

int main(int argc, char const *argv[]) {
  ll A, B;
  std::cin >> A;
  std::cin >> B;
  std::vector<ll> candi;
  for(ll i=1;i*i<=B;i++){
    if(B%i==0){
      candi.push_back(i);
      if(i*i!=B) candi.push_back(B/i);
    }
  }
  ll ans = 0, reg;
  for(int i=0;i<candi.size();i++){
    //candi
    if(candi[i]>2*A || B/candi[i]>2*A) continue;
    if(candi[i]<=A) reg = candi[i]-1;
    else reg = 2*A-candi[i]+1;
    //B/candi
    if(B/candi[i]<=A) reg *= B/candi[i]-1;
    else reg *= 2*A - B/candi[i]+1;
    ans += reg;
  }
  std::cout << ans << '\n';
  return 0;
}