#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1000000007;
const LL LINF=1LL<<60;
const int INF=1<<30;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};



vector<LL> divi(LL K){
    vector<LL> v;
    for(int i=1;i*i<=K;i++){
        if(K%i) continue;
        v.pb(i);
        v.pb(K/i);
    }
    sort(ALL(v));
    v.erase(unique(ALL(v)),v.end());
    return v;
}



int main(){
    LL n,k;cin >> n >> k;
    auto p = divi(k);
    LL ans = 0;
    for(auto q:p){
        LL t = k/q;
        LL ca = max(0LL,min(q-1,n) - max(q-n,1LL) + 1);
        LL cb = max(0LL,min(t-1,n) - max(t-n,1LL) + 1);
        ans += ca*cb;
    }
    cout << ans << endl;
    return 0;
}