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

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b,i) do { cout << "["; for (int (i) = (a);(i) < (b);++(i)) cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

int main() {
    ll n,k;
    cin >> n >> k;
    ll ans = 0;
    vector<ll> a;
    for (ll i = 2;i*i <= k;++i) if (k%i == 0) {
        if (i > 2*n) break;
        if (k/i > 2*n) continue;
        a.push_back(i);
        if (k/i != i) a.push_back(k/i);
    }
    for (ll i : a) {
        ans += (n-abs(i-n-1))*(n-abs(k/i-n-1));
    }
    cout << ans << endl;
    return 0;
}