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

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcountll

#define INF 1e16
#define mod 1000000007

vector<ll> divisor(ll n){
  vector<ll> res;
  for(ll i=1;i*i<=n;i++){
    if(n%i==0){
      res.push_back(i);
      if(i!=n/i)res.push_back(n/i);
    }
  }
  return res;
}

ll N,K;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin>>N>>K;
  vector<ll> ds=divisor(K);

  ll res=0;
  rep(i,ds.size()){
    ll sumac=ds[i];
    ll sumbd=K/ds[i];

    if(sumac>2*N)continue;
    if(sumbd>2*N)continue;

    ll cntac=min(N,sumac-1)-max(sumac-N,1LL)+1;
    ll cntbd=min(N,sumbd-1)-max(sumbd-N,1LL)+1;

    res+=cntac*cntbd;
  }
  cout<<res<<endl;

  return 0;
}