#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	ll n, k; cin>>n>>k;
	ll ans=0;
	for(ll i=1; i*i<=k; i++){
		if(k%i!=0) continue;
		ll c1=max(0ll, min(i-1, n)-max(1ll, i-n)+1);
		ll c2=max(0ll, min(k/i-1, n)-max(1ll, k/i-n)+1);
		if(i*i<k) ans+=2*c1*c2;
		else ans+=c1*c2;
	}
	cout<<ans<<endl;
	return 0;
}