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

#define int long long

signed main(){
    int n, k;
    cin >> n >> k;

    vector<int> vec;
    for(int i = 1;i*i <= k;i++){
        if(k % i == 0){
            vec.push_back(i);
            if(i != k / i) vec.push_back(k/i);
        }
    }

    sort(vec.begin(), vec.end());

    int num[100010] = {};
    for(int i = 1;i < vec.size();i++){
        int r = min(n, vec[i]-1);
        int l = max(1ll, vec[i]-n);

        if(l <= r){
            num[i] = (r-l)+1;
        }
    }
    
    int ans = 0;
    for(int i = 0;i < vec.size();i++){
        ans += num[i] * num[vec.size()-1-i];
    }

    cout << ans << endl;
    return 0;
}