#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORR(x,arr) for(auto& x:arr)
#define PII pair<int, int>
#define FI first 
#define SE second
#define ALL(x) (x).begin(), (x).end()
const int INF=1<<30; const ll LINF=1LL<<60; const ll mod=1e9+7; const int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//-------------------

ll solve(ll n, ll k) {
    ll ans = 0;
    for (ll i = 1; i*i <= k; ++i) {
        if (k % i == 0) {
			ll ac = i;
			ll bd = k/i;
			if(ac > 2*n || bd > 2*n) continue;
			//cout << i << ' ' << k/i <<endl;
			ll cur = min(n+1,i)- max(1LL,i-min(n,i)) ;
			cur *= min(n+1,k/i)-max(1LL,k/i-min(n,k/i)) ;
			//cout << cur;
			if(i*i!=k){
            	cur *= 2;
			}
			ans += cur;
        }
    }
    return ans;
}

int main(){
	ll n,k; cin >> n >> k;
	cout << solve(n,k) << endl;
    return 0;
}