#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long MOD
= 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;



int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/

	ll n, k; scanf("%lld %lld", &n, &k);
	ll res = 0;

	for (ll i = 2; i * i <= k && i <= 2 * n; i++) {
		if (k % i != 0) continue;
		if (k / i <2 || k / i > n * 2) continue;
		ll l_min = max(1LL, i - n);
		ll l_max = min(n, i - 1);
		ll r_min = max(1LL, k / i - n);
		ll r_max = min(n, k / i - 1);
		if (i != k / i) {
			res += (l_max - l_min + 1) * (r_max - r_min + 1) * 2;
		}
		else {
			res += (l_max - l_min + 1) * (r_max - r_min + 1);

		}
	}
	cout << res << endl;
	return 0;
}