#include <iostream>
using namespace std;
int main(){
  long long n,k;cin>>n>>k;
  long long ans = 0;
  for(long long i = 2; k >= i*i; i++){
    if(!(k%i)){
      //   1 ->   i/2
      //(i-1)->[i/2]
      long long ansx;
      long long x = i-n;
      if(x>0){
        ansx = max(0LL,(n-x+1));
      }else{
        ansx = i-1;
      }
      long long ansy;
      long long y = (k/i)-n;
      if(y>0){
        ansy = max(0LL,(n-y+1));
      }else{
        ansy = (k/i)-1;
      }
      ans += ansx*ansy*((k/i)==i?1:2);
      //cout << i << "(" << ansx << ") " << k/i << "(" << ansy << ")" << endl;
    }
  }
  cout << ans << endl;
}